Comparing partitions

@article{Hubert1985ComparingP,
  title={Comparing partitions},
  author={Lawrence J. Hubert and Phipps Arabie},
  journal={Journal of Classification},
  year={1985},
  volume={2},
  pages={193-218},
  url={https://api.semanticscholar.org/CorpusID:189915041}
}
A measure based on the comparison of object triples having the advantage of a probabilistic interpretation in addition to being corrected for chance is proposed and bounded between ยฑ1.5 and ยฑ2.5.
View on Springer Nature
2,067 Citations
Highly Influential Citations
210
Background Citations
192
Methods Citations
543
Results Citations
2

2,067 Citations

Comparing clusterings---an information based distance

sARI: a soft agreement measure for class partitions incorporating assignment probabilities

An extension of the ARI, the soft adjusted Rand index (sARI), with similar intuition and interpretation but also incorporating information from one or two soft partitions is proposed, supporting the intuition that in general, mapping to hard partitions tends to increase the measure of similarity between partitions.

Investigating cluster validation metrics for optimal number of clusters determination

An extensive set of well-known validity indices, based on the approach of the so-called relative criteria, are examined comparatively and a total of 26 cluster validation measures were investigated in two distinct case studies: one in real-world and one in artificially generated data.

An Extension of the Infinite Relational Model Incorporating Interaction between Objects

This paper proposes an extension of the IRM by introducing a subset mechanism that selects a part of the data according to the interaction among objects and presents posterior probabilities for running collapsed Gibbs sampling to learn the model from the given data.

Comparison of modularity-based approaches for nodes clustering in hypergraphs

A comparative analysis of the performance of modularity-based methods for clustering nodes in binary hypergraphs using different quality measures, including true clustering recovery, running time, (local) maximization of the objective, and the number of clusters detected.

A modification of the k-means method for quasi-unsupervised learning

Unsupervised extra trees: a stochastic approach to compute similarities in heterogeneous data

The empirical study shows that the approach based on UET outperforms existing methods in some cases and reduces the amount of preprocessing typically needed when dealing with real-world datasets.

Adaptive clustering with a variance-aware criterion: An alternative to k-means

A generalized version of the incremental one-by-one clustering algorithm of MacQueen (1967) is introduced and evaluated that is suitable for general variance-based criteria, whether convex or not and performs remarkably well with a variety of heterogeneous data sets.

Suboptimal Comparison of Partitions

It is concluded that no standard measures of either internal or external validation can guarantee a correspondence with optimal clustering performance, and recommendations are provided for the suboptimal evaluation of clusteringperformance.

CENTRAL PARTITION FOR A PARTITION- DISTANCE AND STRONG PATTERN GRAPH

    J. Costa
    Computer Science, Mathematics
  • 2004
This paper considers the problem of finding a consensus partition between the set of these partitions, called central partition, and defines a new graph where the nodes are the strong patterns, by using the concept of strong patterns.
...