A split-merge framework for comparing clusterings
- Publication Type:
- Conference Proceeding
- Citation:
- Proceedings of the 29th International Conference on Machine Learning, ICML 2012, 2012, 2 pp. 1055 - 1062
- Issue Date:
- 2012-10-10
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2013004288OK.pdf | 428.67 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation between two clusterings as a bipartite graph and propose a general component-based decomposition formula based on the components of the graph. Most existing measures are examples of this formula. In order to satisfy consistency in the component, we further propose a split-merge framework for comparing clusterings of different data sets. Our framework gives measures that are conditionally normalized, and it can make use of data point information, such as feature vectors and pairwise distances. We use an entropy-based instance of the framework and a coreference resolution data set to demonstrate empirically the utility of our framework over other measures. Copyright 2012 by the author(s)/owner(s).
Please use this identifier to cite or link to this item: