A binary integer program to maximize the agreement between partitions

DOI10.1007/s00357-008-9013-9zbMath1260.62041OpenAlexW1978437975MaRDI QIDQ734372

Michael J. Brusco, Douglas Steinley

Publication date: 13 October 2009

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-008-9013-9

zbMATH Keywords

contingency tablesbinary integer programmingpartition agreement

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Integer programming (90C10) Contingency tables (62H17)

Related Items (5)

Model similarity and rank-order based classification of Bayesian networks ⋮ Minimum adjusted Rand index for two clusterings of a given size ⋮ Explicit agreement extremes for a \(2 \times 2\) table with given marginals ⋮ Dissimilarity and similarity measures for comparing dendrograms and their applications ⋮ A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• On similarity indices and correction for chance agreement
• Measures of association for cross classifications
• A polynomial algorithm for an integer quadratic non-separable transportation problem
• An algorithm to maximize the agreement between partitions
• The variation of the spectrum of a normal matrix
• A proposed index of the conformity of one sociometric measurement to another
• A Method for Comparing Two Hierarchical Clusterings
• Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
• LOQO user's manual — version 3.10

This page was built for publication: A binary integer program to maximize the agreement between partitions