Cluster ensembles aim to generate a stable and robust consensus clustering by combining multiple different clustering results of a dataset. Multiple clusterings can be represented either by multiple co-association pairwise relations or cluster based features. Traditional clustering ensemble algorithms learn the consensus clustering using either of the two representations, but not both. In this paper, we propose to integrate the two representations in a unified framework by means of weighted graph regularized nonnegative matrix factorization. Such integration makes the two representations complementary to each other and thus outperforms both of them in clustering accuracy and stability. Extensive experimental results on a number of datasets further demonstrate this. © 2011 Springer-Verlag.
CITATION STYLE
Du, L., Li, X., & Shen, Y. D. (2011). Cluster ensembles via weighted graph regularized nonnegative matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7120 LNAI, pp. 215–228). https://doi.org/10.1007/978-3-642-25853-4_17
Mendeley helps you to discover research relevant for your work.