Comparing classification tree structures : a special case of comparing q -ary relations

Israël-César Lerman

RAIRO - Operations Research - Recherche Opérationnelle (1999)

  • Volume: 33, Issue: 3, page 339-365
  • ISSN: 0399-0559

How to cite


Lerman, Israël-César. "Comparing classification tree structures : a special case of comparing $q$-ary relations." RAIRO - Operations Research - Recherche Opérationnelle 33.3 (1999): 339-365. <>.

author = {Lerman, Israël-César},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {classification tree; relations; mathematical representation; random permutational model},
language = {eng},
number = {3},
pages = {339-365},
publisher = {EDP-Sciences},
title = {Comparing classification tree structures : a special case of comparing $q$-ary relations},
url = {},
volume = {33},
year = {1999},

AU - Lerman, Israël-César
TI - Comparing classification tree structures : a special case of comparing $q$-ary relations
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1999
PB - EDP-Sciences
VL - 33
IS - 3
SP - 339
EP - 365
LA - eng
KW - classification tree; relations; mathematical representation; random permutational model
UR -
ER -


  1. P. ARABIEand L. J. HUBERT, Combinatorial data analysis, Annual Review of Psychology, 1992, 43, p. 169-203. Zbl0925.62009
  2. F. B. BAKE, Stability of two hierarchical grouping techniques, J. American Statistical Association, 1974, 69, p. 440-445. 
  3. J. P. BENZECRI, L'Analyse des Données, Tome 1 : La Taxinomie, Paris, Dunod, 1973. Zbl0297.62039MR593138
  4. A. BRAVAIS, Analyse mathématique sur les probabilités des erreurs de situation d'un point, Mémoires de l'Institut de France, 21846, p. 255-332. 
  5. H. E. DANIELS, The relation between measures of correlation in the universe of sample permutations, Biometrika, 1944, 33, p. 129-135. Zbl0063.01034MR10941
  6. F. DAUDÉ, Analyse et justification de la Notion de Ressemblance dans l'Optique de la Classification Hiérarchique par AVL, Thèse de l'Université de Rennes I, 24 juin 1992. 
  7. E. B. FOWLKESand C. L. MALLOWS, A method for comparing two hierarchical clusterings, J. American Statistical Association, 1983, 78, p. 553-584. Zbl0545.62042
  8. O. FRANKand K. SVENSSON, On probability distributions of single-linkage dendrograms, J. Statist. Comput. Simulation, 1981, 12, p. 121-131. Zbl0453.62048MR629041
  9. L. A. GOODMANand W. H. KRUSKAL, Measures of association for cross classification, J. American Statistical Association, 1954, 49, p. 732-764. Zbl0056.12801
  10. A. GUÉNOCHEand B. MONJARDET, Méthodes ordinales et combinatoires en analyse des données, Rev. Mathématiques et Sciences Humaines, 1987, 25, p. 5-47. Zbl0641.68031MR941908
  11. A. GUÉNOCHE, Ordinal properties of tree distances (personnal communication), Discrete Mathematics, 1998, 191 (in press). Zbl0956.05031MR1656729
  12. J. HÁJEKand Z. SIDAK, Theory of Rank Tests, Academic Press, New York and London, 1967. Zbl0944.62045MR229351
  13. V. HAMANN, Merkmalbestand und verwandtschaft sbeziehungen der farinosae. Ein Beitragzum System der Monokotyledonen, Willdenowia, 1961, 2, p. 639-768. 
  14. L. J. HUBERT, Inference procedures for the evaluation and comparison of proximity matrices, Numerical Taxonomy, J. Felsenstein, Ed., NATO ASI Series, Springer Verlag, Berlin, 1983, p. 209-228. 
  15. L. J. HUBERT, Assignment Methods in Combinatorial Data Analysis, Marcel Decker, New-York, 1987. Zbl0628.62003MR863418
  16. A. JOVICIC, Minimal entropy algorithm for solving node problems, IFCS-96, Data Science Classification and Related Methods, Abstracts, 1996, 2, p. 115-116. 
  17. M. G. KENDALL, Rank Correlation Methods, Charles Griffin, fourth edition, 1965. Zbl0199.53501
  18. F. J. LAPOINTEand P. LEGENDRE, Comparison tests for dendrograms: A comparative evaluation, J. Classification, 1995, 12, p. 265-282. 
  19. F. J. LAPOINTEand P. LEGENDRE, A stastistical framework to test the congruence of two nested classification, Systematic Zoology, 1990, 39, p. 1-13. 
  20. G. LECALVÉ, Un indice de similarité pour des variables de types quelconques, Statist. Anal. Données, 1976, 01-02, p. 39-47. 
  21. I. C. LERMAN, Les Bases de la Classification Automatique, Gauthier-Villars, collection Programmation, Paris, 1970. Zbl0199.51402MR349079
  22. I. C. LERMAN, Formal analysis of a general notion of proximity between variables, Congrès Européen des Stastisticiens, Grenoble 1976, Recent Developments in Statistics, North Holland, 1977, p. 787-795. Zbl0367.62074MR478478
  23. I. C. LERMAN, Classification et Analyse Ordinale des Données, Paris, Dunod, 1981. Zbl0485.62051MR645150
  24. I. C. LERMAN, Justification et validité statistique d'une échelle [0,1] de fréquence mathématique pour une structure de proximité sur un ensemble de variables observées, Publications de l'Institut de Statistique de l'Université de Paris, XXIX, 1984, Fasc. 3-4, p. 27-57. Zbl0661.62047MR782088
  25. I. C. LERMAN, Maximisation de l'association entre deux variables qualitatives ordinales, Rev. Mathématiques et Sciences Humaines, 1987, 100, p. 49-56. Zbl0635.62048MR941909
  26. I. C. LERMAN, Formules de réactualisation en cas d'agrégations multiples, RAIRO Oper. Res., 1989, 25, n°2, p. 151-163. Zbl0674.62042MR1016137
  27. I. C. LERMAN, Conception et analyse de la forme limite d'une famille de cooefficients statistiques d'association entre variables relationnelles, I and II : Revue Mathématiques Informatique et Sciences Humaines; 1922, I : 118, p, 35-522, II : 119, p. 75-100. Zbl0851.62040MR1195699
  28. I. C. LERMAN, Likelihood linkage analysis (LLA) classification (Around an example treated by hand), Biochimie, Elsevier editions, 1993, 75, p. 379-397. 
  29. I. C. LERMAN, Comparing Classification tree Structures: a Special Case of Comparing q-Ary Relations, Publication interne 1078 IRISA (April 1997) and Rapport de recherche 3167 INRIA (Mai 1997); 37 pages, 1997. Zbl0948.05023
  30. I. C. LERMAN and N. GHAZZALI, What do we retain from a classification tree ? An experiment in image coding, Symbolic-Numeric Data Analysis and Learning, E. Diday and Y. Lechevallier, Eds., Nova Science Publishers, 1991, p. 27-42. 
  31. I. C. LERMAN and Ph. PETER, Structure maximale pour la somme des carrés d'une contingence aux marges fixées; une solution algorithmique programmée, RAIRO Oper. Res., 1988, 22, p. 83-136. Zbl0639.90101MR952103
  32. N. MANTEL, Detection of disease clustering and a generalized regression approach, Cancer Research, 1967, 2, p. 209-220. 
  33. F. MARCOTORCHINO and P. MICHAUD, Optimisation en Analyse Ordinale des Données, Paris, Masson, 1979. 
  34. H. MESSATFA, Unification Relationnelle des Critères et Structures Optimales des Tables de Contingence, Thèse de doctorat de l'Université de Paris 6, 1990. 
  35. H. MESSATFA, An algorithm to maximize the agreement between partitions, J. Classification, 1992, 9, p. 5-15. Zbl0755.62047MR1168379
  36. F. MURTAGH, Counting dendrograms: A survey, Discrete Appl. Math., 1984, 7, p. 191-199. Zbl0528.62055MR727923
  37. A. OCHIAI, Zoogeographic studies on the soleoid fishes in Japan and its neighbouring regions, Bull. Japanese Soc. Sci. Fisheries, 1957, 22, p. 526-530. 
  38. M. OUALI-ALLAH, Analyse en Préordonnances des Données Qualitatives, Applications aux Données Numériques et Symboliques, Thèse de doctorat de l'Université de Rennes I 1991. 
  39. K. PEARSON, Notes on the history of correlation, Biometrika, 1920, 13, p. 25-45. Zbl0212.22604
  40. S. REGNIER, Sur quelques aspects mathématiques des problèmes de la classification automatique, Internat. Comput. Center Bull., 1965, 4, p. 175-191. Zbl0548.62040
  41. F. ROUXEL, Comparaison d'arbres de classification, rapport de DEA, Informatique et Recherche Opérationnelle, Université Paris VI, 1997. 
  42. C. SPEARMAN, The proof and measurement of association between two things, Amer. J. Psychology, 1904, 15, p. 88. 
  43. C. SPEARMAN, A footrule for measuring correlation, British J. Psychology, 1906, 2, p. 89. 
  44. R. R. SOKAL and F. J. ROHLF, The comparison of dendograms by objective methods, Taxon, 1962, 11, p. 33-40. 
  45. G. U. YULE, On the methods of measuring the association between two attributes, J. Roy. Statist. Soc., 1912, 75, p. 579-352. 

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.