A binary integer program to maximize the agreement between partitions
From MaRDI portal
Publication:734372
Recommendations
- An algorithm to maximize the agreement between partitions
- A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties
- Consensus of partitions: a constructive approach
- An optimising approach to alternative clustering schemes
- An exact algorithm for the two-mode \(KL\)-means partitioning problem
Cites work
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 4022343 (Why is no real title available?)
- A Method for Comparing Two Hierarchical Clusterings
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- A proposed index of the conformity of one sociometric measurement to another
- An algorithm to maximize the agreement between partitions
- LOQO user's manual — version 3.10
- Measures of association for cross classifications
- On similarity indices and correction for chance agreement
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- The variation of the spectrum of a normal matrix
Cited in
(6)- A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties
- Explicit agreement extremes for a \(2 \times 2\) table with given marginals
- Model similarity and rank-order based classification of Bayesian networks
- An algorithm to maximize the agreement between partitions
- Minimum adjusted Rand index for two clusterings of a given size
- Dissimilarity and similarity measures for comparing dendrograms and their applications
This page was built for publication: A binary integer program to maximize the agreement between partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734372)
