Data Clustering Using Evidence Accumulation

  • Authors:
  • Affiliations:
  • Venue:
  • ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d - dimensional data is decomposed into a large number of compact clusters; the K-means algorithm performs this decomposition, with several clusterings obtained by N random initializations of the K-means. Taking the co-occurrences of pairs of patterns in the same cluster as votes for their association, the data partitions are mapped into a co-association matrix of patterns. This n 脳 n matrix represents a new similarity measure between patterns. The final clusters are obtained by applying a MST-based clustering algorithm on this matrix. Results on both synthetic and real data show the ability of the method to identify arbitrary shaped clusters in multidimensional data.