Multiple Kernel Clustering With Compressed Subspace Alignment
- 9 July 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (1) , 252-263
Abstract
Multiple kernel clustering (MKC) has recently achieved remarkable progress in fusing multisource information to boost the clustering performance. However, the O( n²) memory consumption and O( n³ ) computational complexity prohibit these methods from being applied into median- or large-scale applications, where n denotes the number of samples. To address these issues, we carefully redesign the formulation of subspace segmentation-based MKC, which reduces the memory and computational complexity to O( n) and O( n² ), respectively. The proposed algorithm adopts a novel sampling strategy to enhance the performance and accelerate the speed of MKC. Specifically, we first mathematically model the sampling process and then learn it simultaneously during the procedure of information fusion. By this way, the generated anchor point set can better serve data reconstruction across different views, leading to improved discriminative capability of the reconstruction matrix and boosted clustering performance. Although the integrated sampling process makes the proposed algorithm less efficient than the linear complexity algorithms, the elaborate formulation makes our algorithm straightforward for parallelization. Through the acceleration of GPU and multicore techniques, our algorithm achieves superior performance against the compared state-of-the-art methods on six datasets with comparable time cost to the linear complexity algorithms.Keywords
Funding Information
- National Key Research and Development Program of China (2020AAA0107100)
- National Natural Science Foundation of China (61922088, 61906020, 61773392, 61976196, 62006237)
- Nantong Science and Technology Program (JC2020065)
This publication has 46 references indexed in Scilit:
- Robust hashing for multi-view data: Jointly learning low-rank kernelized similarity consensus and hash functionsImage and Vision Computing, 2017
- Constructing the L2-Graph for Robust Subspace Learning and Subspace ClusteringIEEE Transactions on Cybernetics, 2016
- Multi-View Clustering Based on Belief PropagationIEEE Transactions on Knowledge and Data Engineering, 2015
- A Unified Framework for Representation-Based Subspace Clustering of Out-of-Sample and Large-Scale DataIEEE Transactions on Neural Networks and Learning Systems, 2015
- Robust Subspace Clustering for Multi-View Data by Exploiting Correlation ConsensusIEEE Transactions on Image Processing, 2015
- Large Scale Spectral Clustering Via Landmark-Based Sparse RepresentationIEEE Transactions on Cybernetics, 2014
- Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farmsAnnals of Operations Research, 2011
- Multiple Kernel Clustering2009
- Learning by local kernel polarizationNeurocomputing, 2009
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004