An algorithm to maximize the agreement between partitions

DOI10.1007/BF02618465zbMath0755.62047WikidataQ126264404 ScholiaQ126264404MaRDI QIDQ1203100

H. Messatfa

Publication date: 4 February 1993

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

zbMATH Keywords

partitionscontingency tablesmeasures of associationequivalence classindex of agreementmarginal description

Mathematics Subject Classification ID

Contingency tables (62H17)

Related Items (8)

Model similarity and rank-order based classification of Bayesian networks ⋮ Comparing three partitions: an inferential approach based on multi-way contingency tables ⋮ Minimum adjusted Rand index for two clusterings of a given size ⋮ Explicit agreement extremes for a \(2 \times 2\) table with given marginals ⋮ A binary integer program to maximize the agreement between partitions ⋮ On the connections between statistical disclosure control for microdata and some artificial intelligence tools ⋮ A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks ⋮ A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The variation of the spectrum of a normal matrix
• A proposed index of the conformity of one sociometric measurement to another
• Maximal association for the sum of squares of a contingency table
• An Algorithm for Partitioning the Nodes of a Graph

This page was built for publication: An algorithm to maximize the agreement between partitions