Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix
- 18 September 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Abstract
Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data by performing clustering on the learned optimal embedding across views. Though demonstrating promising performance in various applications, most of existing methods usually linearly combine a group of pre-specified first-order Laplacian matrices to construct the optimal Laplacian matrix, which may result in limited representation capability and insufficient information exploitation. Also, storing and implementing complex operations on the {$n\times n}$ Laplacian matrices incurs intensive storage and computation complexity. To address these issues, this paper first proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix, and then extends it to the late fusion version for accurate and efficient multi-view clustering. Specifically, our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base Laplacian matrices simultaneously. By this way, the representative capacity of the learned optimal Laplacian matrix is enhanced, which is helpful to better utilize the hidden high-order connection information among data, leading to improved clustering performance. We design an efficient algorithm with proved convergence to solve the resultant optimization problem. Extensive experimental results on nine datasets demonstrate the superiority of the proposed algorithmKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61773392)
This publication has 31 references indexed in Scilit:
- Multi-View Clustering Based on Belief PropagationIEEE Transactions on Knowledge and Data Engineering, 2015
- Large-scale spectral clustering based on pairwise constraintsInformation Processing & Management, 2015
- Spectral co-clustering ensembleKnowledge-Based Systems, 2015
- LINE2015
- Large Scale Spectral Clustering Via Landmark-Based Sparse RepresentationIEEE Transactions on Cybernetics, 2014
- Time and space efficient spectral clustering via column sampling2011
- Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farmsAnnals of Operations Research, 2011
- Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix DecompositionsSIAM Review, 2011
- Multiview Spectral EmbeddingIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2010
- Spectral grouping using the nystrom methodIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004