Sparse Graph Tensor Learning for Multi-View Spectral Clustering
- 12 June 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 8 (5) , 3534-3543
Abstract
Multi-view spectral clustering has achieved impressive performance by learning multiple robust and meaningful similarity graphs for clustering. Generally, the existing literatures often construct multiple similarity graphs by certain similarity measure (e.g. the Euclidean distance), which lack the desired ability to learn sparse and reliable connections that carry critical information in graph learning while preserving the low-rank structure. Regarding the challenges, a novel Sparse Graph Tensor Learning for Multi-view Spectral Clustering (SGTL) method is designed in this paper, where multiple similarity graphs are seamlessly coupled with the cluster indicators and constrained with a low-rank graph tensor. Specifically, a novel graph learning paradigm is designed by establishing an explicit theoretical connection between the similarity matrices and the cluster indicator matrices, in order that the constructed similarity graphs enjoy the desired block diagonal and sparse property for learning a small portion of reliable links. Then, we stack multiple similarity matrices into a low-rank graph tensor to better preserve the low-rank structure of the reliable links in graph learning, where the key knowledge conveyed by singular values from different views is explicitly considered. Extensive experiments on several benchmark datasets demonstrate the superiority of SGTL.Keywords
Funding Information
- National Natural Science Foundation of China (62276277)
- Support Scheme of Guangzhou for Leading Talents in Innovation and Entrepreneurship (2019017)
This publication has 40 references indexed in Scilit:
- Multi-order similarity learning for multi-view spectral clusteringPattern Recognition, 2022
- Representation Learning in Multi-view Clustering: A Literature ReviewData Science and Engineering, 2022
- Low-rank tensor approximation with local structure for multi-view intrinsic subspace clusteringInformation Sciences, 2022
- Low-rank tensor constrained co-regularized multi-view spectral clusteringNeural Networks, 2020
- Graph-regularized least squares regression for multi-view subspace clusteringKnowledge-Based Systems, 2020
- One-step Kernel Multi-view Subspace ClusteringKnowledge-Based Systems, 2020
- On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank MinimizationInternational Journal of Computer Vision, 2018
- Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD2014
- Reduced rank regression via adaptive nuclear norm penalizationBiometrika, 2013
- Factorization strategies for third-order tensorsLinear Algebra and its Applications, 2011