A uniqueness theorem for clustering

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 639-646

  Zadeh, Reza Bosagh ^a   Ben David, Shai ^b  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; TAXONOMIES;

AXIOMATIC APPROACH; DATA PARTITIONING; DESIRED DATUM; GENERAL THEORY; IMPOSSIBILITY RESULTS; SINGLE LINKAGE; SINGLE LINKAGE CLUSTERING; UNIQUENESS THEOREM;

CLUSTERING ALGORITHMS;

EID: 80053155634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Ackerman and S. Ben-David. Measures of Clustering Quality: A Working Set of Axioms for Clustering. In NIPS 2008, 2008.
2. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. In STOC 2001, pages 11-20. ACM New York, NY, USA, 2001. (Pubitemid 32865713)
3. J.C. Gower and GJS Ross. Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18(1):54-64, 1969.
4. N. Jardine and R. Sibson. The construction of hierarchic and non-hierarchic classifications. Multivariate Statistical Methods, Among-groups Covariation, 1975.
5. J. Kleinberg. An Impossibility Theorem for Clustering. In NIPS 2002. MIT Press, 2003.
6. U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.