Article

Comparing clusterings: an axiomatic view

Author:

Marina MeilǎAuthors Info & Claims

ICML '05: Proceedings of the 22nd international conference on Machine learning

Pages 577 - 584

https://doi.org/10.1145/1102351.1102424

Published: 07 August 2005 Publication History

Get Access

Abstract

This paper views clusterings as elements of a lattice. Distances between clusterings are analyzed in their relationship to the lattice. From this vantage point, we first give an axiomatic characterization of some criteria for comparing clusterings, including the variation of information and the unadjusted Rand index. Then we study other distances between partitions w.r.t these axioms and prove an impossibility result: there is no "sensible" criterion for comparing clusterings that is simultaneously (1) aligned with the lattice of partitions, (2) convexely additive, and (3) bounded.

References

[1]

Ben-Hur, A., Elisseeff, A., & Guyon, I. (2002). A stability based method for discovering structure in clustered data. Pacific Symposium on Biocomputing (pp. 6--17).]]

Google Scholar

[2]

Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. Wiley.]]

Digital Library

Google Scholar

[3]

Fowlkes, E. B., & Mallows, C. L. (1983). A method for comparing two hierarchical clusterings. Journal of the American Statistical Association, 78, 553--569.]]

Crossref

Google Scholar

[4]

Golumbic, M. (1980). Algorithmic graph theory and perfect graphs. Academic Press, New York.]]

Digital Library

Google Scholar

[5]

Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193--218.]]

Crossref

Google Scholar

[6]

Kleinberg, J. (2002). An impossibility theorem for clustering. Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press.]]

Google Scholar

[7]

Meilǎ, M. (2003). Comparing clusterings by the variation of information. Proceedings of the Sixteenth Annual Conference ofn Computational Learning Theory (COLT). Springer.]]

Crossref

Google Scholar

[8]

Mirkin, B. (1996). Mathematical classification and clustering. Kluwer Academic Press.]]

Google Scholar

[9]

Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66, 846--850.]]

Crossref

Google Scholar

[10]

Rènyi, A. (1970). Probability theory. North-Holland.]]

Google Scholar

[11]

Stanley, R. P. (1997). Enumerative combinatorics. Cambridge University Press.]]

Digital Library

Google Scholar

[12]

van Dongen, S. (2000). Performance criteria for graph clustering and Markov cluster experiments (Technical Report INS-R0012). Centrum voor Wiskunde en Informatica.]]

Digital Library

Google Scholar

[13]

Wallace, D. L. (1983). Comment. Journal of the American Statistical Association, 78, 569--576.]]

Google Scholar

Cited By

View all

Cuevas EGuzmán-Rosales CPérez-Cisneros MSarkar R(2024)A Graph Segmentation Method Based on Compatibility Subgraph AggregationIEEE Access10.1109/ACCESS.2024.338185412(48277-48293)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3381854
Canales JCanales JGarcía-Lamont FYee-Rendon ACastilla JMazahua L(2024)Optimal segmentation of image datasets by genetic algorithms using color spaces▪Expert Systems with Applications: An International Journal10.1016/j.eswa.2023.121950238:PDOnline publication date: 15-Mar-2024
https://dl.acm.org/doi/10.1016/j.eswa.2023.121950
Anžel AHeider DHattab G(2024)Interactive polar diagrams for model comparisonComputer Methods and Programs in Biomedicine10.1016/j.cmpb.2023.107843242:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.cmpb.2023.107843
Show More Cited By

Comparing clusterings: an axiomatic view
1. Mathematics of computing

Recommendations

Comparing hard and overlapping clusterings

Similarity measures for comparing clusterings is an important component, e.g., of evaluating clustering algorithms, for consensus clustering, and for clustering stability assessment. These measures have been studied for over 40 years in the domain of ...
Combining Multiple Clusterings Using Evidence Accumulation

We explore the idea of evidence accumulation (EAC) for combining the results of multiple clusterings. First, a clustering ensemble a set of object partitions, is produced. Given a data set (n objects or patterns in d dimensions), different ways of ...
Comparing Subspace Clusterings

We present the first framework for comparing subspace clusterings. We propose several distance measures for subspace clusterings, including generalizations of well-known distance measures for ordinary clusterings. We describe a set of important ...

Comments

Information & Contributors

Information

Published In

ICML '05: Proceedings of the 22nd international conference on Machine learning

August 2005

1113 pages

ISBN:1595931805

DOI:10.1145/1102351

General Chair:
Saso Dzeroski
Jozef Stefan Institute, Slovenia
,
Program Chairs:
Luc De Raedt,
Stefan Wrobel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 August 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 140 of 548 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

368
Total Citations
View Citations
1,372
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)7

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cuevas EGuzmán-Rosales CPérez-Cisneros MSarkar R(2024)A Graph Segmentation Method Based on Compatibility Subgraph AggregationIEEE Access10.1109/ACCESS.2024.338185412(48277-48293)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3381854
Canales JCanales JGarcía-Lamont FYee-Rendon ACastilla JMazahua L(2024)Optimal segmentation of image datasets by genetic algorithms using color spaces▪Expert Systems with Applications: An International Journal10.1016/j.eswa.2023.121950238:PDOnline publication date: 15-Mar-2024
https://dl.acm.org/doi/10.1016/j.eswa.2023.121950
Anžel AHeider DHattab G(2024)Interactive polar diagrams for model comparisonComputer Methods and Programs in Biomedicine10.1016/j.cmpb.2023.107843242:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.cmpb.2023.107843
Khan ZYang J(2024)Nonparametric K-means clustering-based adaptive unsupervised colour image segmentationPattern Analysis and Applications10.1007/s10044-024-01228-527:1Online publication date: 28-Feb-2024
https://doi.org/10.1007/s10044-024-01228-5
Gagolewski M(2024)Normalised Clustering Accuracy: An Asymmetric External Cluster Validity MeasureJournal of Classification10.1007/s00357-024-09482-2Online publication date: 28-Jun-2024
https://doi.org/10.1007/s00357-024-09482-2
Murashov D(2023)Method for Combining Image Segmentation Maps on the Basis of Information Redundancy and Variation of Information MinimizationOptoelectronics, Instrumentation and Data Processing10.3103/S875669902205011958:5(457-464)Online publication date: 3-Mar-2023
https://doi.org/10.3103/S8756699022050119
Tania SKarmakar GTeng SMurshed M(2023)A Robust Local Texture Descriptor in the Parametric Space of the Weibull DistributionIEEE Transactions on Multimedia10.1109/TMM.2022.320422025(6053-6066)Online publication date: 2023
https://doi.org/10.1109/TMM.2022.3204220
Duan BCao JWang WCai DYan Y(2023)Cell Instance Segmentation VIA Multi-Scale Non-Local Correlation2023 IEEE 20th International Symposium on Biomedical Imaging (ISBI)10.1109/ISBI53787.2023.10230512(1-5)Online publication date: 18-Apr-2023
https://doi.org/10.1109/ISBI53787.2023.10230512
Lv XSu ZZhang TCheng WQi X(2023)Adaptive Non-local Affinity Graph for Unsupervised Image Segmentation2023 IEEE International Conference on Multimedia and Expo (ICME)10.1109/ICME55011.2023.00402(2357-2362)Online publication date: Jul-2023
https://doi.org/10.1109/ICME55011.2023.00402
Bruzadin ABoaventura MColnago MNegri RCasaca W(2023)Learning label diffusion maps for semi-automatic segmentation of lung CT images with COVID-19Neurocomputing10.1016/j.neucom.2022.12.003522(24-38)Online publication date: Feb-2023
https://doi.org/10.1016/j.neucom.2022.12.003
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Comparing hard and overlapping clusterings

Combining Multiple Clusterings Using Evidence Accumulation

Comparing Subspace Clusterings

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Comparing hard and overlapping clusterings

Combining Multiple Clusterings Using Evidence Accumulation

Comparing Subspace Clusterings

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations