Comparing partitions

  title={Comparing partitions},
  author={L. Hubert and P. Arabie},
  journal={Journal of Classification},
  • L. Hubert, P. Arabie
  • Published 1985
  • Journal of Classification
  • The problem of comparing two different partitions of a finite set of objects reappears continually in the clustering literature. We begin by reviewing a well-known measure of partition correspondence often attributed to Rand (1971), discuss the issue of correcting this index for chance, and note that a recent normalization strategy developed by Morey and Agresti (1984) and adopted by others (e.g., Miligan and Cooper 1985) is based on an incorrect assumption. Then, the general problem of… CONTINUE READING
    1,539 Citations
    Comparing clusterings---an information based distance
    • 1,211
    • PDF
    Relational Generalizations of Cluster Validity Indices
    • 43
    • PDF
    Adjusting for Chance Clustering Comparison Measures
    • 56
    • Highly Influenced
    • PDF
    Understanding partition comparison indices based on counting object pairs
    • 1
    • Highly Influenced
    • PDF
    Comparing hard and overlapping clusterings
    • 8
    • Highly Influenced
    • PDF
    An Extension of the Infinite Relational Model Incorporating Interaction between Objects
    • 6
    • Highly Influenced
    • PDF
    A modification of the k-means method for quasi-unsupervised learning
    • 8
    • Highly Influenced
    • PDF
    Extending the rand, adjusted rand and jaccard indices to fuzzy partitions
    • R. Brouwer
    • Computer Science
    • Journal of Intelligent Information Systems
    • 2008
    • 59
    Adaptive clustering with a variance-aware criterion: An alternative to k-means