Affordable Access

Multiple Consensuses Clustering by Iterative Merging/Splitting of Clustering Patterns

Authors
Publication Date
Source
HAL-INRIA
Keywords
  • Unsupervised Learning
  • Clustering
  • Consensus Clustering
  • Ensemble Clustering
  • Closed Patterns
  • [Info.Info-Ds] Computer Science [Cs]/Data Structures And Algorithms [Cs.Ds]
  • [Info.Info-Ai] Computer Science [Cs]/Artificial Intelligence [Cs.Ai]
External links

Abstract

The existence of many clustering algorithms with variable performance on each dataset made the clustering task difficult. Consensusclustering tries to solve this problem by combining the partitions generated by different algorithms to build a new solution that is more stable and achieves better results. In this work, we propose a new consensus method that, unlike others, give more insight on the relations between the different partitions in the clusterings ensemble, by using the frequent closed itemsets technique, usually used for association rules discovery. Instead of generating one consensus, our method generates multiple consensuses based on varying the number of base clusterings, and links these solutions in a hierarchical representation that eases the selection of the best clustering. This hierarchical view also provides an analysis tool, for example to discover strong clusters or outlier instances.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments
F