Consensus en classification : une revue bibliographique

 Access to full text

 Full (PDF)

1. I - Le Probleme MATHEMATIQUE DE L'AGREGATION : articles ou livres de base. Arrow, K.J., (1951) : Social Choice and Individual Values, New York, Wiley. 
2. Bandelt, H.J., Barthelemy, J.P., (1984) : "Medians in Median Graphs", Discrete Applied Mathematics, 8, 131-142. Zbl0536.05057MR743019
3. Barbut, M., (1961) : "Médiane, distributivité, éloignements", repr. (1980), Mathématiques et Sciences humaines, 70, 5-31. Zbl0439.06007MR593433
4. Barthelemy, J.P., (1979b) : "Propriétés métriques des ensembles ordonnés. Comparaison et agrégation des relations binaires", Thèse, Université de Besançon. 
5. Barthelemy, J.P., Janowitz, M.F., (1988): "Axioms for Consensus Rules" (titre provisoire), prépublication. 
6. Barthelemy, J.P., Monjardet, B., (1980) : "Ajustement et résumé de données relationnelles : les relations centrales", in E. Diday et al., eds., Data Analysis and Informatics, Amsterdam, North-Holland. 
7. Barthelemy, J.P., Monjardet, B., (1981) : "The Median Procedure in Cluster Analysis and Social Choice Theory", Mathematical Social Sciences, 1, (3), 235-268. Zbl0486.62057MR616379
8. Barthelemy, J.P., Monjardet, B., (1988) : "The Median procedure in data analysis : new results and open problems", in H.H. Bock (ed.), Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. MR999565
9. Borda, J.C., (1784) : Mémoire sur les élections au scrutin ; histoire de l'Académie Royale des Sciences pour 1781, Paris. 
10. Condorcet, M.J.A. (1785) : Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Paris. 
11. Day, W.H.E., (1988) : "Consensus methods as tools for data analysis ", in H.H. Bock (ed.), Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. MR999566
12. Guilbaud, G.Th., (1952) : "Les théories de l'intérêt général et le problème logique de l'agrégation", Economie Appliquée, 5, 501-551, repr. (1968) in Eléments de la Théorie des Jeux, Paris, Dunod. 
13. Janowitz, M.F., (1988) : "Induced Social Welfare Functions", Mathematical Social Sciences, (to appear). Zbl0664.90005MR947869
14. Leclerc, B., (1988a) : "Consensus Applications in the Social Sciences ", in H.H. Bock (ed.), Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. 
15. Leclerc, B., (1988b) : Medians and Majorities in Semimodular Lattices, rapport CMS-P031, Paris, Centre d'Analyse et de Mathématique Sociales. 
16. Marcotorchino, F., Michaud, P., (1980) : Optimisation en analyse de données relationnelles, in E. Diday et al., eds., Data Analysis and Informatics, Amsterdam, North-Holland, 655-670. Zbl0485.62002
17. Michaud, P., Marcotorchino, F., (1979) : "Modèles d'optimisation en analyse de données relationnelles", Mathématiques et Sciences humaines, 67, 7-38. Zbl0446.62058
18. Mirkin, B.G., (1974) : Group Choice (en russe), Trad. anglaise (1979), P. Fisburn, ed., Washington, Winston. 
19. Monjardet, B., (1980) : "Théorie et applications de la médiane dans les treillis distributifs finis", Annals of Discrete Mathematics, 9, 87-91. Zbl0451.06012MR597358
20. Monjardet, B., (1987) : "Arrowian Characterizations of Latticial Fédération Consensus Functions", Rapport CMS-P030, Paris, Centre d'Analyse et de Mathématique Sociales. Zbl0746.90002
21. Young, H.P., Levenglick, A., (1978) : "A Consistent Extension of Condorcet's Election Principle", SIAM Journal on Applied Mathematics, 35, 285-300. Zbl0385.90010MR504073
22. Adams, E.N., III (1972) : "Consensus Techniques and the Comparison of Taxonomic Trees", Systematic Zoology, 21, 390-397. 
23. Adams, E.N., III (1986) : "N-Trees as Nestings : Complexity, Similarity and Consensus, J. of Classification3, n°2, 299-317. Zbl0647.62057MR874241
24. Barthelemy, J.P., (1976) : Sur les éloignements symétriques et le principe de Pareto, Math. Sci. hum.56, 97-125. Zbl0379.90007MR443835
25. Barthelemy, J.P., (1977a) : A propos des partitions centrales sur un ensemble non nécessairement fini, Statistique et Analyse des données3, 54-62. 
26. Barthelemy, J.P., (1977b) : Comparaison et agrégation des partitions et des préordres totaux, C.R. Acad. Sci. Paris, A-285, 985-987. Zbl0399.05004MR498173
27. Barthelemy, J.P., (1979b) : "Propriétés métriques des ensembles ordonnés. Comparaison et agrégation des relations binaires". Thèse, Université de Besançon. 
28. Barthelemy, J.P., (1988a) : Comments on "Aggregations of Equivalence Relations", by P.C. Fishburn and A. Rubinstein, à paraître dans le Journal of Classification. Zbl0655.62109
29. Barthelemy, J.P., (1988b) : Thresholded consensus for n-trees, à paraître dans J. of Classification. Zbl0691.62057MR971154
30. Barthelemy, J.P., Leclerc, B., Monjardet, B., (1984a) : "Ensembles ordonnés et taxonomie mathématique ", in Orders : Description and Roles, eds. M. Pouzet and D. Richard, Annals of Discrete Mathematics, 23, Amsterdam, North-Holland, 523-548. Zbl0566.62051MR779868
31. Barthelemy, J.P., Leclerc, B., Monjardet, B., (1984b) : "Quelques aspects du consensus en classification ", in Data Analysis and Informatics III, eds. E. Diday et al., Amsterdam, North-Holland, 307-316. Zbl0566.62047MR787643
32. Barthelemy, J.P., Leclerc, B., Monjardet B., (1986): On the Use of Ordered Sets in Problems of Comparison and Consensus of Classifications, J. of Classification3, n°2, 187-224. Zbl0647.62056MR874238
33. Barthelemy, J.P., McMorris, F.R., (1986) : "The Median Procedure for n-trees", J. of Classification3, n°2, 329-334. Zbl0617.62066MR874243
34. BOCK, H.H., ed. (1988) : Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. Zbl0732.00020MR999548
35. Celeux, G., (1984): Approximation rapide et interprétation d'une partition centrale pour les algorithmes de partitionnement. Rapport INRIA n°301, INRIA, Rocquencourt. 
36. Constantinescu, M., Sankoff, D., (1986) : Tree Enumeration Modulo a Consensus, J. of Classification3, n°2, 349-356. Zbl0652.92002MR874245
37. Day, W.H.E., (1986a) : Foreword : Comparison and Consensus of Classifications, J. of Classification3, n°2,183-185. 
38. Day, W.H.E., McMorris, F.R., (1985) : "A Formalization of Consensus Index Methods", Bulletin of Mathematical Biology, 47, 215-229. Zbl0572.62052MR803562
39. Diday, E., (1988) : Compatibility and Consensus in Numerical Taxonomy, Rapport de Recherches, Rocquencourt, INRIA, à paraître. 
40. Finden, C.R., Gordon, A.D., (1985) : "Obtaining Common Pruned Trees", J. of Classification2, 255-276. 
41. Fishburn, P.C., Rubinstein, A., (1986) : Aggregation of Equivalence Relations, J. of Classification3, 61-65. Zbl0607.62141MR845458
42. Gordon, A.D., (1980) : On the Assessment and Comparison of Classifications, in R.Thomassone (ed.), Analyse des Données et Informatique, Amsterdam, North-Holland, 193-218. 
43. Gordon, A.D., (1986) : Consensus Supertrees : the synthesis of rooted trees containing overlapping sets of labeled leaves, J. of Classification3, n°2, 335-348. Zbl0623.62051MR874244
44. Gordon, A.D., (1987) : A review of Hierarchical Classification, J. of the Royal Statist. Soc., (series A), 150,119-137. Zbl0616.62086MR896652
45. Grotschel, M., Wakabayashi, Y. (1987) : A cutting Plane Algorithm for a Clustering Problem, rapport de recherches n°9, Schwerpunktprogramm der Deutschen Forschungsgemeinschaft, Institut für Mathematik, Universität Augsburg. Zbl0675.90072
46. Hendy, M., Penny, D. and Henderson, I.M., (1988) : Families of Trees and Consensus, in H.H. Bock (ed.), Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. MR999548
47. Leclerc, B., (1984) : "Efficient and Binary Consensus Functions on Transitively Valued Relations",Mathematical Social Sciences, 8, 45-61. Zbl0566.90003MR781659
48. Lerman, I.C., Peter, Ph., (1985) : Elaboration et logiciel d'un indice de similarité entre objets d'un type quelconque. Application au problème du consensus en classification, rapport 262, IRISA, Rennes. 
49. Marcotorchino, F., Michaud, P., (1981) : Heuristic approach to the similarity aggregation problem, Methods of operation research43, 395-404. Zbl0505.90002
50. Marcotorchino, F., Michaud, P., (1982) : "Agrégation de similarités en classification automatique", Revue de Statistique Appliquée, 30, 21-44. Zbl0537.62006MR676088
51. Margush, T., McMorris, F.R., (1981) : "Consensus n-Trees", Bulletin of Mathematical Biology, 43, 239-244. Zbl0455.92019MR661505
52. McMorris F.R., Neumann, D.A., (1983) : "Consensus Functions on Trees", Mathematical Social Sciences, 4,131-136. Zbl0511.90010MR698010
53. McMorris, F.R., (1985) : "Axioms for Consensus Functions on Undirected Phylogenetic Trees", Mathematical Biosciences, 74,17-21. Zbl0569.92001MR791858
54. Mirkin, B.G., (1975) : "On the Problem of Reconciling Partitions", in Quantitative Sociology, International Perspectives on Mathematical and Statistical Modelling, New-York, Academic Press, 441-449. MR444120
55. Nelson, G., (1979) : "Cladistic Analysis and Synthesis : principles and definitions, with a historical note on Adanson's Familles des plantes (1763-1764)", Syst. Zool., 28, 1-21. 
56. Neumann, D.A., (1983) : "Faithful Consensus Methods for n-Trees", Math. Biosci., 63, 271-287. Zbl0539.62073MR695731
57. Neumann, D.A., Norton, V., (1986a) : On Lattice Consensus Methods, J. of Classification3, n°2, 225-255. Zbl0617.62068MR874239
58. Neumann, D.A., Norton, V., (1986b) : Clustering and Isolation in the Consensus Problem for Partitions", J. of Classification3, n°2, 281-297. Zbl0624.62059MR874240
59. Regnier, S., (1965) : "Sur quelques aspects mathématiques des problèmes de classification automatique", ICC Bulletin, 4, 175-191. Repr. (1983) Mathématiques et Sciences humaines, 82, 13-29. Zbl0548.62040
60. Regnier, S., Fernandez de la Vega, W., (1976) : Préhension et interprétation de plusieurs classifications d'un même ensemble de données, rapport ADISH, Paris. 
61. Schader, M., (1981) : Scharfe und unscharfe Klassification qualitative Daten, Athenäum, Känigstein. Zbl0511.62062MR638037
62. Schader, M., Tüshaus, U., (1986) : Subgradient methods for analyzing qualitative data, in: W. Gaul and M. Schader, eds., Classification as a tool of Research, Amsterdam, North-Holland. MR913129
63. Sokal, R.R., Rohlf, F.J., (1981) : "Taxonomic Congruence in the Leptopodomorpha Reexamined", Syst. Zool., 30, 309-325. 
64. Stinebrickner, R., (1984a) : "s-Consensus Trees and Indices", Bull. of Math. Biology, 46, 923-935. Zbl0546.92001MR779171
65. Stinebrickner, R., (1984b) : "An Extension of Intersection Methods from Trees to Dendrograms", Syst. Zool., 33, 381-386. 
66. Stinebrickner, R., (1986) : "s-Consensus Index Method : an additional axiom, J. of Classification3, n°2, 319-327. Zbl0617.62067MR874242
67. Vach, W., Degens, P.O., (1987) : The System of Common Lower Neighbours of a Hierarchy, Communication à la 1ère Conférence Internationale de la Fédération des Sociétés de Classification, Aix-la-Chapelle. Zbl0733.92030MR999556
68. Wakabayashi, Y., (1986) : Aggregation of Binary Relations : algorithmic and polyhedral investigations, thèse, Universität Augsburg. Zbl0606.68036
69. Arabie, P., Boorman, S.A., (1973) : Multidimensional Scaling of Measures of Distance between Partitions, J. of Mathematical Psychology17, 31-63. Zbl0263.92003MR321559
70. Barthelemy, J.P., (1977b) : Comparaison et agrégation des partitions et des préordres totaux, C.R. Acad. Sci. Paris, A-285, 985-987. Zbl0399.05004MR498173
71. Barthelemy, J.P., (1979a) : Caractérisations axiomatiques de la distance de la différence symétrique entre des relations binaires, Math. Sci. hum.67, 85-113. Zbl0418.06003
72. Barthelemy, J.P., Leclerc, B., Monjardet, B., (1984a) : "Ensembles ordonnés et taxonomie mathématique ", in Orders : Description and Roles, M. Pouzet and D. Richard (eds.), Annals of Discrete Mathematics, 23, Amsterdam, North-Holland, 523-548. Zbl0566.62051MR779868
73. Barthelemy, J.P., Leclerc, B., Monjardet, B., (1984b) : "Quelques aspects du consensus en classification ", in Data Analysis and Informatics III, E. Diday et al. (eds.), Amsterdam, North-Holand, 307-316. Zbl0566.62047MR787643
74. Barthelemy, J.P., Leclerc, B., Monjardet, B., (1986) : On the Use of Ordered Sets in Problems of Comparison and Consensus of Classifications", J. of Classification3, n°2, 187-224. Zbl0647.62056MR874238
75. Bobisud, H.M., Bobisud, L.E., (1972) : "A metric for Classifications", Taxon21, 607-613. Zbl0224.34046
76. Boorman, S.A., Arabie, P., (1972) : "Structural Measures and the Methods of Sorting ", in Multidimensional Scaling, vol. 1, Theory and Applications in the Behavioral Sciences, R.N. Shepard, A.K. Romney and S.B. Nerlove (eds.), New-York: Seminar Press, 226-249. 
77. Boorman, S.A., Olivier, D.C., (1973) : "Metrics on Spaces of Finite Trees", J. of Mathematical Psychology10, 26-59. Zbl0271.92011MR317975
78. Colless, (1980) : "Congruence between Morphometric and Allozyme data for Menidia species: a reappraisal", Syst. Zool., 29, 288-299. 
79. Constantinescu, M., Sankoff, D., (1986) : Tree Enumeration Modulo a Consensus, J. of classification3, n°2, 349-356. Zbl0652.92002MR874245
80. Day, W.H.E., (1981) : "The Complexity of Computing Metric Distances Between Partitions", Mathematical Social Sciences, 1, 269-287. Zbl0497.62049MR616380
81. Day, W.H.E., (1986b) : Analysis of quartet dissimilarity measures between undirected phylogenetic trees, Syst. Zool., 35, 325-333. 
82. Day, W.H.E., Faith, D.P., (1986) : "A Model in Partial Orders for Comparing Objects by Dualistic Measures", Mathematical Biosciences, 8, 179-192. Zbl0591.62093MR830602
83. Day, W.H.E., McMorris, F.R., (1985) : "A Formalization of Consensus Index Methods", Bulletin of Mathematical Biology, 47, 215-229. Zbl0572.62052MR803562
84. Day, W.H.E., Wells, R.S., (1984) : "Extremes in the Complexity of Computing Metric Distances Between Partitions", IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6, 69-73. Zbl0531.62058
85. Estabrook, G.F., McMorris, F.R., Meacham, C.A., (1985) : Comparison of Undirected Phylogenetic Trees Based on Subtrees of four Evolutionary Units, Syst. Zool., 34, 193-200. 
86. Faith, D.P., Belbin, L., (1986) : Comparison of classifications using measures intermediate between metric dissimilarity and consensus similarity, J. of Classification3, n°2, 257-280. Zbl0623.62050
87. Farris, J.S., (1969) : "A Successive Approximations Approach to Character Weighting", Syst. Zool., 18, 374-385. 
88. Hartigan, J.A., (1967) : "Representation of Similarity Matrices by Trees ", J. Amer. Statist. Ass., 62, 1140-1158. MR226760
89. Hubert, L., Arabie, P., (1985) : Comparing partitions, J. of Classification2, n°2/3, 193-218. Zbl0587.62128
90. Hubert, L., Arabie, P., (1986) : Comparing partitions, in W. Goul et M. Schader (eds.), Classification as a Tool of Research, Amsterdam, North-Holland. Zbl0587.62128MR913115
91. Hubert, L.J., Baker, F.B., (1977) : "The Comparison and Fitting of Given Classification Schemes", J. Math. Psychol., 16, 233-253. Zbl0368.62109MR484565
92. Leclerc, B., (1981): "Description combinatoire des ultramétriques" Math. Sci. hum, 73,5-37. Zbl0476.05079MR623034
93. Leclerc, B., (1985a) : "Les hiérarchies de parties et leurs demi-treillis ", Math. Sci. hum., 89, 5-34. Zbl0563.68060MR800206
94. Leclerc, B., (1985b) : "La comparaison des hiérarchies : indices et métriques", Mathématiques et Sciences humaines, 92, 5-40. Zbl0592.62050MR866224
95. Margush, T., (1982) : "Distances Between Trees", Discrete Applied Mathematics, 4, 281-290. Zbl0504.06002MR677026
96. Mickevich, M.F., (1978) : "Taxonomic congruence", Syst. Zool., 27, 143-158. 
97. Nelson, G., (1979) : "Cladistic Analysis and Synthesis : principles and definitions, with a historical note on Adanson's Familles des plantes(1763-1764) ", Syst. Zool., 28, 1-21. 
98. Nelson, G., Platnick, N., (1981) : Systematics and Biogeography. Cladistics and Vicariance, Columbia University Press, New-York. 
99. Phipps, J.B., (1971) : "Dendrogram Topology", Syst. Zool., 20, 306-308. 
100. Robinson, D.F., (1971) : Comparison of Labelled Trees with Valency Three, J. of Combinatorial Theory, 11, 105-119. Zbl0185.27704MR294170
101. Robinson, D.F., Foulds, L.R., (1981) : "Comparison of Phylogenetic Trees", Math. Biosci., 53, 131-147. Zbl0451.92006MR613619
102. Rohlf, F.J., (1982) : "Consensus indices for comparing classifications ", Math. Biosci.59,131-144. MR673311
103. Schader, M., (1979) : Distance minimale entre partitions et préordonnances dans un ensemble fini, Math. Sci. hum., 67, 39-47. Zbl0419.04001
104. Schader, M., (1980) : Hierarchical Analysis : Classification with Ordinal Object Dissimilarities, Metrika, 27, 127-132. Zbl0438.62046MR577564
105. Schuh, R.T., Polhemus, J.T., (1980), "Analysis of taxonomic congruence among morphological, ecological and biogeographic data sets for the Leptopodomorpha (Hemiptera) ", Syst. Zool.29, 1-26. 
106. Schuh, R.T., Farris, J.S., (1981) : "Methods for investigating taxonomic congruence and their application to the Leptopodomorpha", Syst. Zool.30, 331-351. 
107. Sokal, R.R., Rohlf, F.J., (1962) : "The comparison of dendrograms by objective methods ", Taxon, 11, 33-39. 
108. Sokal, R.R., Rohlf, F.J., (1981) : "Taxonomic Congruence in the Leptopodomorpha Reexamined", Syst. Zool., 30, 309-325. 
109. Stinebrickner, R., (1984a) : "s-Consensus Trees and Indices", Bull. of Math. Biology, 46, 923-935. Zbl0546.92001MR779171
110. Stinebrickner, R., (1986) : "s-Consensus Index Method : an additional axiom, J. of Classification3, n° 2, 319-327. Zbl0617.62067MR874242
111. Waterman, M.S., Smith, T.F., (1978) : "On the similarity of dendrograms", J. Theor. Biology, 73, 789-800. MR496831
112. Williams, W.T., Clifford, H.T., (1971) : "On the Comparison of two Classifications on the Same Set of Elements", Taxon, 20, 519-522. 
113. Acharya B.D., Las Vergnas, M., (1982) : Hypergraphs with Cyclomatic Number Zero, Triangulated Graphs, and an Inequality, J. Combinatorial Theory B, 33, 52-56. Zbl0506.05047MR678170
114. Apresjan, Ju. D., (1966) : Un algorithme pour construire des classes d'après une matrice de distances, in Mashinnyi perevod : prikladnaja lingvistika, n°9, Moscou, Inst. Maurice Thorez, 3-18. 
115. Barthelemy, J.P., Guenoche, A., (1988) : Les arbres et les représentations des proximités.Paris, Masson. 
116. Batbedat, A., (1985) : Des bijections de Benzécri-Johnson pour les Robinson et les Pyras, Cahier N, UER de Mathématiques, Université des Sciences et Techniques du Languedoc, Montpellier. 
117. Batbedat, A., (1986) : Comment reconnaître une prépyramide, Cahier S., UER de Mathématiques, Université des Sciences et Techniques du Languedoc, Montpellier. 
118. Batbedat, A., (1987) : Deux prolongements optimaux de la bijection de Benzecri/Johnson, Communication au séminaire "Mathématiques Discrètes et Sciences Sociales", Paris, CAMS. 
119. Benzecri, J.P., (1967) : Description mathématique des classifications, repris in : J.P. BENZECRI et coll., L'analyse des données. 1 - La Taxinomie, Paris, Dunod, 1973. Zbl0162.02402MR593138
120. Bertrand, P., (1986) : Etude de la représentation pyramidale. Thèse de 3ème cycle, Université Paris- Dauphine et INRIARocquencourt. 
121. Bertrand, P., Diday, E., (1985) : A visual representation of the compatibility between an order and a dissimilarity index : the pyramids, Computational Statistics Quaterly2, 31-42. Zbl0615.62080
122. Booth, K.S., Leuker, G.S., (1976) : Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci.13, 335-379. Zbl0367.68034MR433962
123. Brossier, G., (1980) : "Représentation ordonnée des classifications hiérarchiques", Statistiques et Analyse des Données, vol. 5, n°2, 31-44. 
124. Brossier, G., (1986) : Problèmes de représentation de données par des arbres., Thèse d'Etat, Université de Rennes II. 
125. Buneman, P., (1971) : "The Recovery of Trees from Measures of Dissimilarity ", in Mathematics in Archaeological and Historical Sciences, eds. F.R. Hodson, D.G. Kendall and P. Tautu, Edinburgh: Edinburgh University Press, 387-395. 
126. Corge, J., Gourarie, A., Malatere, B., Normand, P., (1983) : Une nouvelle représentation graphique des matrices de dissimilarité : les pyramides. Cahiers de Mathématiques de la Décision n°8408, CEREMADE, Université de Paris-Dauphine. 
127. Day, W.H.E., Sankoff, D., (1986) : The computational Complexity of Inferring Phylogenics by Compatibility, Syst. Zool.35, n°2, 224-229. 
128. Diday, E., (1982) : Croisements, ordres et ultramétriques : applications à la recherche de consensus. Rapport de recherche n°144, INRIARocquencourt. 
129. Diday, E., (1983) : Croisements ordres et ultramétriques. Mathématiques et Sciences humaines, n°83, 31-54. Zbl0528.62056MR728544
130. Diday, E., (1984) : "Une représentation visuelle des classes empiétantes : les pyramides". Rapport de recherche n°291, INRIA, Rocquencourt. Zbl0592.62052
131. Diday, E., (1988) : Compatibility and Consensus in Numerical Taxonomy, Raport de Recherches, Rocquencourt, INRIA, à paraître. 
132. Duchet, P., (1978) : Propriété de Helly et problèmes de représentation, in Problèmes combinatoires et théorie des graphes, éditions du CNRS, Paris. Zbl0413.05042MR540034
133. Durand, C., (1986) : Sur la représentation pyramidale en Analyse de Données, Mémoire de DEA, Université de Provence, Marseille. 
134. Durand, C., Fichet, B., (1988) : One-to-one Correspondences in Pyramidal Representations: a Unified Approach, in : H.H. BOCK (ed.), Classification and Related Methods of Data Analysis, Amsterdam, North-Holland. Zbl0733.92029MR999552
135. Estabrook, G.F., Johnson, C.S. Jr, McMorris, F.R., (1975) : "An idealized concept of the true cladistic character ", Mathematical Biosciences, 23, 263-272. Zbl0302.92007MR395944
136. Estabrook, G.F., Johnson, C.S. Jr, McMorris, F.R., (1976a) : "A mathematical foundation for the analysis of cladistic character compatibility", Mathematical Biosciences, 29, 181-187. Zbl0351.06005MR682089
137. Estabrook, G.F., Johnson, C.S. Jr, McMorris, F.R., (1976b) : "An algebraic analysis of cladistic character ", Discrete Mathematics, 16, 141-147. Zbl0364.92013MR449765
138. Estabrook, G.F., McMorris, F.R., (1977) : "When are two qualitative taxonomic characters compatible ?" , Journal of Mathematical Biology, 4,195-200. Zbl0355.92005MR446568
139. Estabrook, G.F., McMorris, F.R., (1980) : "When is one estimate of evolutionary relationships a rafinement of another ?", Journal of Mathematical Biology, 10, 367-373. Zbl0463.92002MR602254
140. Flament, C., (1975) : Arêtes maximales des cocycles d'un graphe préordonné, Math. Sci. hum., 51, 5-12. Zbl0332.05102MR476572
141. Flament, C., (1978) : Hypergraphes arborés, Discrete Mathematics, 21, 223-227. Zbl0393.05039MR522896
142. Gaud, E., (1983) : Représentations d'une préordonnance. Etude de ses images euclidiennes. Problèmes de graphes dans sa représentation hiérarchique. Thèse de 3ème cycle, Université de Provence, Marseille. 
143. Golumbic, M.C., (1980) : Algorithmic graph theory and perfect graphs, New York, Academic Press. Zbl0541.05054MR562306
144. Guenoche, A. (1988) : Méthodes combinatoires de sériation à partir d'une dissimilarité, in E. DIDAY et al. (eds.), Data Analysis and Informatics 5, Amsterdam, North-Holland. MR975060
145. Hubert, L., Golledge, R.G., (1981) : Matrix reorganization and dynamic programming : applications to paired comparisons and unidimensional seriation, Psychometrika, 46, N°4, 429-441. Zbl0479.62059
146. Hubert, L., Golledge, R.G., Richardson, G.D., (1982) : Proximity matrix reorganization and hierarchical clustering, Environment and planning A, 14, 195-203. 
147. Ibrahim, A., Schektman, Y., (1985) : Analyse en partitions principales, algorithmes et exemples, in : C. Perruchet, ed., Actes des journées de classification deMontpellier, SFC et CNET, Paris. 
148. Ibrahim, A., Schektman, Y., (1986) : Principal cluster analysis, in : W. Gaul, M. Schader, eds., Classification as a Tool of Research, North-Holland, Amsterdam, 217-223. Zbl0595.62056MR913115
149. Jardine, N., (1969b) : Towards a General Theory of Clustering, Biometrics25, 609-610. 
150. Jardine, N., Sibson, R., (1971) : Mathematical Taxonomy, London, Wiley. Zbl0322.62065MR441395
151. Kendall, D.G., (1969) : Incidence matrices, interval graphs, and seriation in archaeology, Pacific J. Math., 28, 565-570. Zbl0185.03301MR239990
152. Leclerc, B., (1985a) : "Les hiérarchies de parties et leurs demi-treillis ", Mathématiques et Sciences humaines, 89, 5-34. Zbl0563.68060MR800206
153. Leclerc, B., (1986) : Caractérisation, construction et dénombrement des ultramétriques supérieures minimales, Statistique et analyse de données, 11, 26-50. Zbl0624.62056MR920357
154. Leclerc, B., (1987) : Arbres minimums communs et compatibilité de données de types variés, Mathématiques et Sciences humaines,98, 41-67. Zbl0691.05012MR911630
155. McMorris, F.R., (1975) : "Compatibility criteria for cladistic and qualitative taxonomic characters", in G.F. Estabrook, ed., The Eighth International Conference on Numeriacal Taxonomy, San Francisco: W.H. Freeman, 399-415. Zbl0364.92012
156. McMorris, F.R., (1977) : "On the compatibility of binary qualitative taxonomic characters", Bulletin of Mathematical Biology, 39, 133-138. Zbl0356.92003MR526406
157. Reinert, M., (1987) : Classification descendante hiérarchique et analyse lexicale par contexte. Application au corpus des poésies d'A. Rimbaud, Bull. de Méthodologie Sociologique, 13, 53-90.** 
158. Robinson, W.S., (1951) : A Method for Chronological Ordering of Archaeological Deposits, American Antiquity, 16, 293-301. 
159. Statistique et Analyse des Données10, n°1 (1985) : numéro spécial sur l'analyse conjointe de plusieurs tableaux de données. 
160. Barthelemy, J.P., Leclerc, B., Monjardet B., (1986) : On the Use of Ordered Sets in Problems of Comparison and Consensus of Classifications, J. of Classification3, n°2, 187-224. Zbl0647.62056MR874238
161. Booth, K.S., Leuker, G.S., (1976) : Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci.13, 335-379. Zbl0367.68034MR433962
162. Day, W.H.E., (1981) : "The Complexity of Computing Metric Distances between Partitions", Mathematical Social Sciences, 1, 269-287. Zbl0497.62049MR616380
163. Day, W.H.E., (1983a) : "The Role of Complexity in Comparing Classifications ", Mathematical Biosciences, 66, 97-114. Zbl0525.62058MR718592
164. Day, W.H.E., (1983b) : "Computationally Difficult Parsimony Problems in Phylogenetic Systematics", Journal of Theoretical Biology, 103, 429-438. MR714631
165. Day, W.H.E., (1985) : "Optimal Algorithms for Comparing Trees with Labelled Leaves", Journal of Classification, 2, 7-28. Zbl0589.62044MR800511
166. Day, W.H.E., Sankoff, D., (1986) : The computational Complexity of Inferring Phylogenics by Compatibility, Syst. Zool.35, n°2, 224-229. 
167. Day, W.H.E., Wells, R.S., (1984) : "Extremes in the Complexity of Computing Metric Distances between Partitions", IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6, 69-73. Zbl0531.62058
168. Golumbic, M.C., (1980) : Algorithmic graph theory and perfect graphs, Academic Press, New-York. Zbl0541.05054MR562306
169. Leclerc, B., (1987) : Arbres minimums communs et compatibilité de données de types variés, Mathématiques et Sciences humaines, 98, 41-67. Zbl0691.05012MR911630
170. Wakabayashi, Y., (1985) : Aggregation of Binary Relations : algorithmic and polyhedral investigations, thèse, Universität Augsburg. Zbl0606.68036
171. Guenoche, A., (1982-1986) : Programmes ABCD (Analyse Booléenne et Combinatoire de Données) : sous-tableaux de Robinson, sériation, arbres de Buneman. 
172. Felsenstein, J., et al., (1980-1986) : Package PHYLIP (Phylogeny Inference Package) : inclut notamment un programme de calcul de hiérarchies consensus. 

1. Mark Dwyer, Fred R. McMorris, Robert C. Powers, Removal independence and multi-consensus functions
2. R. Chifflet, P. Gerin, A. Dazord, J. P. Boissel, Essai de définition de la structure de la qualité de la vie à l'aide de techniques d'analyse de données
3. A. Guenoche, B. Monjardet, Méthodes ordinales et combinatoires en analyse des données