Cluster ensembles via weighted graph regularized nonnegative matrix factorization

  • Authors:
  • Liang Du;Xuan Li;Yi-Dong Shen

  • Affiliations:
  • State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China

  • Venue:
  • ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.