Spectral Ensemble Clustering via Weighted K-Means: Theoretical and Practical Evidence
Authors:
Open Access
- 9 January 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 29 (5) , 1129-1143
Abstract
As a promising way for heterogeneous data analytics, consensus clustering has attracted increasing attention in recent decades. Among various excellent solutions, the co-association matrix based methods form a landmark, which redefines consensus clustering as a graph partition problem. Nevertheless, the relatively high time and space complexities preclude it from wide real-life applications. We, therefore, propose Spectral Ensemble Clustering (SEC) to leverage the advantages of co-association matrix in information integration but run more efficiently. We disclose the theoretical equivalence between SEC and weighted K-means clustering, which dramatically reduces the algorithmic complexity. We also derive the latent consensus function of SEC, which to our best knowledge is the first to bridge co-association matrix based methods to the methods with explicit global objective functions. Further, we prove in theory that SEC holds the robustness, generalizability, and convergence properties. We finally extend SEC to meet the challenge arising from incomplete basic partitions, based on which a row-segmentation scheme for big data clustering is proposed. Experiments on various real-world data sets in both ensemble and multi-view clustering scenarios demonstrate the superiority of SEC to some state-of-the-art methods. In particular, SEC seems to be a promising candidate for big data clustering.Keywords
Funding Information
- National Natural Science Foundation of China (71531001, 71322104, 71471009, U1636210, 71490723, 71171007)
- National High Technology Research and Development Program of China (SS2014AA012303)
- National Center for International Joint Research on E-Business Information Processing (2013B01035)
- Fundamental Research Funds for the Central Universities
- Australian Research Council (FT-130101457, DP-140102164, LP-150100671)
- US National Science Foundation
- CNS (1314484)
- US National Science Foundation
- IIS (1651902)
This publication has 39 references indexed in Scilit:
- Infinite Ensemble for Image Clustering2016
- Multi-View Clustering via Joint Nonnegative Matrix Factorization2013
- Multi-Objective Multi-View Spectral Clustering via Pareto Optimization2013
- A SURVEY OF CLUSTERING ENSEMBLE ALGORITHMSInternational Journal of Pattern Recognition and Artificial Intelligence, 2011
- Multiview Spectral EmbeddingIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2010
- Multi-view clustering via canonical correlation analysis2009
- Relational learning via collective matrix factorization2008
- Correlational spectral clustering2008
- Consensus Clusterings2007
- Multi-View Clustering2005