Abstract
Given the marginal description of two partitionsC andY of the same set, an index of agreement between the two partitions is given by the number of pairs appearing together in an equivalence class in both partitions. LetC be fixed andY an unknown partition represented by its marginal description. We consider the following problem: finding the distribution of objects (conditioned by the marginal description ofY) which maximizes the agreement betweenC andY. We discuss some approaches that have proposed, and we obtain a heuristic procedure from the solution of a linear transportation problem.
Résumé
Soit une mesure d'association entre deux partitions,C etY, du même ensemble. Supposons queC soit fixée et que pourY nous ne possédions que la distribution de ses classes (nombre et taille de chaque classe). Considérons le problème suivant: déterminer la distribution des objets dans les classes deY de façon à maximiser les accords entre les classes deC et celles deY. Nous présentons quelques approches proposées dans la litérature et dérivons une procédure heuristique à partir de la solution d'un problème de transport.
Similar content being viewed by others
References
BOORMAN, S. A., and ARABIE, P. (1972), “Structural Measures and the Method of Sorting,” inMultidimensional Scaling: Theory and Applications in the Behavioral Sciences, Vol. 1: Theory, Eds. R. N. Shepard, A. K. Romney and S. B. Nerlove, New York: Seminar Press, 225–218.
BARNES, E. R. (1982), “An Algorithm for Partitioning the Nodes of a Graph,”SIAM Journal on Algebraic and Discrete Methods, 4, 541–550.
COHEN, J. (1960), “A Coefficient of Agreement for Nominal Scales,”Educational and Psychological Measurement, 20, 37–46.
GOODMAN, L., and KURSKAL, W. (1979),Measures of Association for Cross Classification, Berlin, New York: Springer-Verlag.
HOFFMAN, A. J., and WIELANDT, H. W. (1953), “The Variation of the Spectrum of a Normal Matrix,”Duke Mathematical Journal, 20, 37–39.
HUBERT, L. J., and BAKER, F. J. (1978), “Evaluating the Conformity of Sociometric Measurements,”Psychometrika, 43, 31–41.
HUBERT, L., and ARABIE, P. (1985), “Comparing Partitions,”Journal of Classification, 2, 193–218.
HUBERT, L. J. (1987),Assignment Methods in Combinatorial Data Analysis, New York: Marcel Dekker.
KATZ, L., and POWELL, J. H. (1953), “A Proposed Index of the Conformity of One Sociometric Measurement to Another,”Psychometrika, 18, 249–256.
LIGHT, R. J. (1971), “Measures of Response Agreement for Categorical Data: Some Gneralizations and Alternatives,”Psychological Bulletin, 66, 376–390.
LERMAN, I. C., and PETER, P. (1988), “Structuration Maximale Pour la somme d'une contingence aux marges fixées: une solution algorithmique programmé,”RAIRO-Recherche Operationnelle, 2, 83–136.
MARCOTORCHINO, F. (1984), “Utilisation des Comparaisons par Paires en Statistiques des Contingence,”IBM Paris Scientific Center Research Report No F-071, Paris.
MESSATFA, H. (1987), “Normalisation conditionnelle des critères de contingence: Approche algorithmique et relationnelle,”IBM Paris Scientific Center Research Report No F-115, Paris.
MESSATFA, H. (1988), “Unification de certains critères d'association par linéarisation et normalisation,”Revue De Statistique Appliquée, 3, 51–68.
MESSATFA, H. (1990), “Maximal Association for the Sum of Squares of a Contingency Table,”RAIRO-Operations Research, 1, 1–19.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Messatfa, H. An algorithm to maximize the agreement between partitions. Journal of Classification 9, 5–15 (1992). https://doi.org/10.1007/BF02618465
Issue Date:
DOI: https://doi.org/10.1007/BF02618465