Structure Learning with Similarity Preserving
Not on the map. Why?
Abstract (arXiv)
Leveraging on the underlying low-dimensional structure of data, low-rank and sparse modeling approaches have achieved great success in a wide range of applications. However, in many applications the data can display structures beyond simply being low-rank or sparse. Fully extracting and exploiting hidden structure information in the data is always desirable and favorable. To reveal more underlying effective manifold structure, in this paper, we explicitly model the data relation. Specifically, we propose a structure learning framework that retains the pairwise similarities between the data points. Rather than just trying to reconstruct the original data based on self-expression, we also manage to reconstruct the kernel matrix, which functions as similarity preserving. Consequently, this technique is particularly suitable for the class of learning problems that are sensitive to sample similarity, e.g., clustering and semisupervised classification. To take advantage of representation power of deep neural network, a deep auto-encoder architecture is further designed to implement our model. Extensive experiments on benchmark data sets demonstrate that our proposed framework can consistently and significantly improve performance on both evaluation tasks. We conclude that the quality of structure learning can be enhanced if similarity information is incorporated.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 0; 2023: 1; 2024: 2.
9 papers.
- 2021Multi-view Contrastive Graph Clusteringcited by 76
- 2021Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-viewcited by 30
- 2021Pseudo-supervised Deep Subspace Clusteringcited by 29
- 2021Towards Clustering-friendly Representations: Subspace Clustering via Graph Filteringcited by 14
- 2024Multilayer Graph Approach to Deep Subspace Clusteringcited by 1
- 2021A Local Similarity-Preserving Framework for Nonlinear Dimensionality Reduction with Neural Networkscited by 0
- 2021Beyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithmscited by 0
- 2023One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clusteringcited by 0
- 2024Subspace Clustering in Wavelet Packets Domaincited by 0
- 2024Subspace Clustering in Wavelet Packets Domain6 Jun 2024
- 2024Multilayer Graph Approach to Deep Subspace Clustering30 Jan 2024
- 2023One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering12 May 2023
- 2021Multi-view Contrastive Graph Clustering22 Oct 2021
- 2021Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering18 Jun 2021
- 2021Pseudo-supervised Deep Subspace Clustering8 Apr 2021
- 2021Beyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithms19 Mar 2021
- 2021A Local Similarity-Preserving Framework for Nonlinear Dimensionality Reduction with Neural Networks10 Mar 2021
- 2021Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view16 Feb 2021