Consensus Affinity Graph Learning for Multiple Kernel Clustering
- 25 June 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 51 (6) , 3273-3284
Abstract
Significant attention to multiple kernel graph-based clustering (MKGC) has emerged in recent years, primarily due to the superiority of multiple kernel learning (MKL) and the outstanding performance of graph-based clustering. However, many existing MKGC methods design a fat model that poses challenges for computational cost and clustering performance, as they learn both an affinity graph and an extra consensus kernel cumbersomely. To tackle this challenging problem, this article proposes a new MKGC method to learn a consensus affinity graph directly. By using the self-expressiveness graph learning and an adaptive local structure learning term, the local manifold structure of the data in kernel space is preserved for learning multiple candidate affinity graphs from a kernel pool first. After that, these candidate affinity graphs are synthesized to learn a consensus affinity graph via a thin autoweighted fusion model, in which a self-tuned Laplacian rank constraint and a top-k neighbors sparse strategy are introduced to improve the quality of the consensus affinity graph for accurate clustering purposes. The experimental results on ten benchmark datasets and two synthetic datasets show that the proposed method consistently and significantly outperforms the state-of-the-art methods.Keywords
Funding Information
- National Natural Science Foundation of China (61673220, 61802188)
- Intelligent Manufacturing and Robot Special Project of Major Science and Technology Project in Sichuan (2020ZDZX0014)
- Science and Technology Special Project of Major Scientific Instruments and Equipment Project in Sichuan (19ZDZX0119)
- Natural Science Foundation of Jiangsu Province of China (BK20180458)
This publication has 39 references indexed in Scilit:
- Implicit Block Diagonal Low-Rank RepresentationIEEE Transactions on Image Processing, 2017
- Rethinking the Inception Architecture for Computer Vision2016
- Weighted Multi-view Clustering with Feature SelectionPattern Recognition, 2016
- Multi-View Clustering Based on Belief PropagationIEEE Transactions on Knowledge and Data Engineering, 2015
- Dual Graph Regularized Latent Low-Rank Representation for Subspace ClusteringIEEE Transactions on Image Processing, 2015
- ImageNet Large Scale Visual Recognition ChallengeInternational Journal of Computer Vision, 2015
- Clustering and projected clustering with adaptive neighbors2014
- Global and Local Structure Preservation for Feature SelectionIEEE Transactions on Neural Networks and Learning Systems, 2013
- Multiple Kernel Fuzzy ClusteringIEEE Transactions on Fuzzy Systems, 2011
- Consistency of spectral clusteringThe Annals of Statistics, 2008