Combinatorial Optimization and Hierarchical Classifications

4OR

Volumn 2, Issue 3, 2004, Pages 179-219

  Barthélemy, Jean Pierre ^a,c   Brucker, François ^a   Osswald, Christophe ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b ENSIETA   (France)

^c CNRS   (France)

Author keywords

Clustering algorithms; Complexity; Hierarchical classification; Quasi hierarchies; Rigid hypergraphs; Subdominant

Indexed keywords

EID: 33745382172     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-004-0051-9     Document Type: Article

References (100)

1. Aho AV, Hopcroft JE, Ullman JD (1974) The design and Analysis of Computer Algorithms. Addison-Wesley, Reading, pp 74-84.
2. Asprejan J-D (1966) Un algorithme pour construire des classes d'après une matrice de distance. Mashinnyi perevod i prikladnaja linguisika 9: 3-18.
3. Bandelt H-J (1992) Four-point characterization of the dissimilarity function obtained from indexed closed weak hierarchies. Mathematisches Seminar, Hamburg Universität, Hamburg.
4. Bandelt H-J, Dress WM (1989) Weak hierarchies associated with a similarity measure-an additive clustering technique. Bulletin of Mathematical Biology 51(1): 133-166.
5. Bandelt H-J, Dress WM (1994) An order theoretic framework for overlapping clustering. Discrete Mathematics 136: 21-37.
6. Barthélemy J-P (2003) Classifications binaires. Actes des Rencontres de la Société Francophone de Classification: 67-69.
7. Barthélemy J-P, Brucker F (2001) NP-hard approximation problems in overlapping clustering. Journal of Classification 18(2): 159-183.
8. Barthélemy J-P, Brucker F (2004) Binary clustering. Preprint.
9. Barthelémy J-P, Guénoche A (1988) Les arbres et les représentations de proximité. Masson, Paris.
10. Batbedat A (1988) Les isomorphismes hte et hts, après la bijection de Benzécri-Johnson. Metron 46: 47-59.
11. Batbedat A (1989) Les dissimilarités médias et arbas. Statistiques et analyse des données 14: 1-18.
12. Bayer R (1972) Symmetric binary b-trees: Data structures and maintenance. Acta Informatica 1: 290-306.
13. Benzécri J-P (1973) L'analyse de données. Dunod, Paris.
14. Bertrand P (2000) Set systems and dissimilarities. European Journal of Combinatorics 21: 727-743.
15. Bertrand P (2002) Set systems for which each set properly intersects at most one other set-application to pyramidal clustering. Cahiers du Ceremade, 0202.
16. Bertrand P, JanowitzM (2003) The k-weak hierarchies: an extension of the weak hierarchical clustering structure. Discrete Applied Mathematics 127: 199-220.
17. Birkhoff G (1967) Lattice theory. American Mathematical Society, Providence.
18. Borůvka O (1926a) O jistém problému minimálniím (about a certain minimal problem). Práce mor. přírodověd. spol. v Brně 3: 37-58.
19. Borůvka O (1926b) Příspěvek k řešení otázky ekonomické stavby elektrovodných sítí (contribution to the solution of the problem of economical construction of electrical networks). Elektrotechnický obzor 15: 153-154.
20. Brucker F (2001) Modèles de classification en classes empiétantes. PhD thesis, EHESS and ENST Bretagne.
21. Brucker F (2002) Sub-dominant theory in numerical taxonomy. ENST-Bretagne (submitted).
22. Brucker F (2003b) Réalisations de dissimilarités. Actes des Rencontres de la Société Francophone de Classification: 7-10.
23. Brucker F (2004) From hypertrees to arboreal quasi-ultrametrics. Discrete Applied Mathematics (forthcoming).
24. Brucker F, Osswald C, Barthélemy J-P (2003) Rigid hypergraphs: combinatorial optimization problem in clustering and similarity analysis. In: INOC 2003 Proceedings, pp 126-133.
25. Brucker P (1978) On the complexity of clustering problems. In: Beckman M, Kunzi HP (eds) Optimization and operations research. Springer, Berlin Heidelberg NewYork, pp 45-54.
26. Carroll JD (1976) Spatial, non-spatial and hybrid models for scaling. Psychometrika 41: 439-463.
27. Carroll JD, Chang JJ (1973) A method for fitting a class of hierarchical tree structure models to dissimilarity data, and its application to some body part data of Miller. In: Proc. of the 81st Convention of the American Psychological Association, vol 8, pp 1097-1098.
28. Carroll JD, Pruzansky S (1980) Discrete and hybrid scaling methods. In: Lauterman EB, Freger H (eds) Similarity and choice. Hans Huber, Bern.
29. Cavalli-Sforza LL, Edwards AWF (1967) Phylogenetic analysis models and estimation procedures. American Journal of Human Genetics 19: 233-257.
30. Chandon JL, Lemaire J, Pouget J (1980) Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés. RAIRO/Recherche Opérationnelle, série Recherche Operationelle 14: 157-170.
31. Chen Z (1996) Space-conserving agglomerative algorithms. Journal of Classification 13: 157-168.
32. Chepoï V, Fichet B (1997) Recognition of robinsonian dissimilarities. Journal of Classification 14: 311-325.
33. ∞-approximation via subdominants. Journal of Mathematical Psychology 44(4): 600-616.
34. Choquet G (1938) Étude de certains réseaux de routes. Comptes-rendus de l'Académie des Sciences 206: 310-313.
35. Colonius H, Schulze HH (1981) Tree structures for proximity data. British Journal of Mathematical and Statistical Psychology 34: 167-180.
36. Van Cutsem B (ed) (1994) Classification and dissimilarity analysis (Lecture Notes in Statistics), vol 93. Springer, Berlin Heidelberg New-York.
37. Diatta J (1996) Une extension de la classification hiérarchique: les quasi-hiérarchies. PhD thesis, Université de Provence 1996.
38. Diatta J (1997) Dissimilarités multivoies et généralisations d'hypergraphes sans triangles. Mathématiques, Informatique et Sciences Humaines 138: 57-73.
39. Diatta J (1998) Approximating dissimilarities by quasi-ultrametrics. Discrete Mathematics 192: 81-86.
40. Diatta J, Fichet B (1994) From Asprejan hierachies and Bandelt-Dress weak-hierarchies to quasihierarchies. In: Diday E et al. (eds) New approaches in classification and data analysis. Springer, Berlin Heidelberg NewYork, pp 111-118.
41. Diday E (1971) Une nouvelle méthode en classification automatique et reconnaissance des formes: la méthode des nuées dynamiques. Revue de Statistique Appliquée 19(2): 19-33.
42. Diday E (1983) Inversions en classification automatique: applications à la construction adaptative d'indices d'agrégation. Revue de Statistique Appliquée 31(1): 45-62.
43. Diday E (1984) Une représentation visuelle des classes empiétantes: les pyramides. Research report 291, INRIA.
44. Diday E (1986) Orders and overlapping clusters in pyramids. In: de Leew J, et al. (eds) Multidimentionnal data analysis proceedings, pp 201-234.
45. Dijkstra E (1959) Two problems in connection with graphs. Numerische Mathematik 1: 269-271.
46. Duchet P (1979) Représentations, Noyaux en théorie des graphes et hypergraphes. PhD thesis, Université Paris VI (Doctorat d'état).
47. Duchet P (1984) Topics in perfect graphs, chapter Classical perfect graphs. An introduction with emphasis on triangulated and interval graphs. North-Holland, Amsterdam, pp 67-96.
48. Durand C (1989) Ordres et graphes pseudo-hiérarchiques: théorie et optimisation algorithmique. PhD thesis, Université de Provence.
49. Farris JS (1969) On the cophenetic correlation coefficients. Systematic Zoology 18: 279-285.
50. Fichet B (1984) Sur une extension de la notion de hiérarchie et son équivalence avec quelques matrices de Robinson. Actes des "Journées de statistique de la Grande Motte": 12-12.
51. Fichet B (1986) Data analysis: geometric and algebraic structures. In: Prohorov YA, et al. (eds) First world congress of the Bernoulli society proceedings. V. N. U. Science Press, pp 123-132.
52. Fichet B (2001) Ultramétriques supérieures minimales sous contraintes. SFC O1: 147-150.
53. Flament C (1962) L'analyse de similitude. Cahiers du Centre de Recherche Opérationnelle 4: 63-97.
54. Flament C (1976) Hypergraphes et analyse de données. Séminaire INRIA.
55. Flament C (1978) Hypergraphes arborés. Discrete Mathematics 21: 223-227.
56. Flament C, Degenne A, Vergès P (1979) Analyse de similitude ordinale. Informatique et Sciences Humaines 40-41: 223-231.
57. Florek K, Kuraszewicz J, Perkal J, Steinhaus H, Zubrzyki S (1951a) Sur la liaison et la division des points d'un ensemble fini. Colloquium Mathematicae 2: 282-285.
58. Florek K, Kuraszewicz J, Perkal J, Steinhaus H, Zubrzyki S (1951b) Taksonomia wroclawska. Przeglad Antropol. 17: 193-207.
59. Garey MR, Johnson DS (1979) Computers and intractability-a guide to the theory of NPCompleteness. Freeman.
60. Gilmore PC (1962) Families of sets with faithful graph representation. Technical report, Thomas J. Watson Research Center, Yorktown Heights.
61. AD Gordon (1999) Classification methods for the exploratory analysis of multivariate data. Chapman and Hill.
62. Gower JC, Ross GJS (1969) Minimal spanning trees and single linkage cluster analysis. Applied Statistics 18: 54-64.
63. Hansen P, Jaumard B (1997) Cluster analysis and mathematical programming. Mathematical programming 79: 191-215.
64. Hansen P, Jaumard B, Mladenovic N (1995) How to choose k entities among n. In: Cox I, Hansen P, Julesz B (eds) Partitioning data sets. Providence, pp 105-116.
65. Hansen P, Jaumard B, Sanlaville E (1994) Partitionning problems in cluster analysis: a review of mathematical approaches. In: Diday E et al. (eds) New approaches in classification and data analysis. Springer, Berlin Heidelberg NewYork, pp 228-240.
66. Hartigan JA (1967) Representation of similarity matrices by trees. Journal of the American Mathematical Society 62: 1140-1158.
67. Hartigan JA (1975) Clustering algorithms. Wiley, Chichester.
68. Henley NM (1969) A psychological study of the semantics of animal terms. Journal of Verbal Learning and Verbal Behavior 8: 176-184.
69. Hubert L, Arabie P, Meulman J (1997) Linear and circular unidimensional scaling for symmetric proximity matrices. British Journal of Mathematical and Statistical Psychology 50: 253-284.
70. Hubert L, Arabie P, Meulman J (1998) Graph-theoretic representations for proximity matrices through strongly-anti-robinsonian or circular strongly-anti-robinsonian matrices. Psychometrica 63(4): 341-358.
71. JanowitzMF (1978)An order theoretic model for cluster analysis. SIAM Journal of Applied Mathematics 34: 55-72.
72. Janowitz MF (1979) Monotone equivariant cluster methods. SIAM Journal of Applied Mathematics 37: 148-165.
73. Janowitz MF (1981) Continuous L-clustering methods. Discrete Applied Mathematics 3: 100-112.
74. Jardine JPJ, Jardine N, Sibson R (1967) The structure and construction of taxonomic hierarchies. Mathematical Biosciences 1: 171-179.
75. Jardine N, Sibson R (1971) Mathematical taxonomy, part II. Wiley, London.
76. Jarník V (1930) O jistém problèmu minimalnim. Práce mor. přírodověd spol v Brně (Acta Societatis Scientiarum Naturalium (Moravicae) 4: 57-63.
77. Johnson SC (1967) Hierarchical clustering schemes. Psychometrika 32: 241-254.
78. Krivanek A, Moravek J (1986) NP-hard problems in hierarchical-tree clustering. Acta Informatica 23: 311-323.
79. Kruskal JB (1956) On the shortest spanning tree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7: 48-50.
80. Lance GN, Williams WT (1967a) A general theory of classificatory sorting strategies. The Computer Journal 9(4): 373-380.
81. Lance GN, Williams WT (1967b) A general theory of classificatory sorting strategies. The Computer Journal 10(3): 271-277.
82. Leclerc B (1981) Description combinatoire des ultramétriques. Mathématiques et Sciences Humaines 73: 5-37.
83. Leclerc B (1984) Comment reconnaître un hypergraphe arboré. Cahiers du CAMS.
84. Leclerc B (1985a) Les hiérarchies de parties et leur demi-treillis. Mathématiques et Sciences Humaines 89: 5-34.
85. Leclerc B (1985b) La comparaison de hiérarchies: indices et métriques. Mathématiques et Sciences Humaines 92: 5-40.
86. McQuitty LL (1957) Elementary linkage analysis for isolating orthogonal and oblique types and typal relevancies. Educational and Psychological Measurement 17: 207-229.
87. Osswald C (2003c) Classification, analyse de la similitude et hypergraphes. PhD thesis, EHESS and ENST Bretagne.
88. Osswald C (2003b) Dissimilarités circulaires et hypercycles. Actes des Rencontres de la Société Francophone de Classification: 165-168.
89. Osswald C (2003a) Robustesse aux variations de méthode pour la classification hiérarchique. In: XXXVèmes Journées de Statistiques. SFdS, Lyon, pp 751-754.
90. Prim RC (1957) Shortest connection network and some generalizations. Bell System Technical Journal 26: 1389-1401.
91. QuilliotA (1984) Circular representation problem on hypergraphs. Discrete Mathematics 51: 251-264.
92. Reingold EM, Nievergelt J, Deo N (1977) Combinatorial algorithms: Theory and practice. Prentice-Hall, Englewood Cliffs.
93. RobinsonWS (1951)Amethod for chronologically ordering archeological deposits. American Antiquity 16: 295-301.
94. Roux M (1968) Un algorithme pour trouver une hiérarchie particulière. PhD thesis, ISUP, Paris.
95. Roux M (1985) Algorithmes de classification. Masson, Paris.
96. Sibson R (1971) Some observations of a paper by Lance and Williams. The Computer Journal 14: 156-157.
97. Sneath PHA (1957) The application of computers to taxonomy. Journal of General Microbiology 17: 201-226.
98. Sokal RR, Rolf FJ (1962) The comparison of dendrograms by objective methods. Taxon 9: 33-40.
99. Sokal RR, Sneath PHA (1963) Principles of numerical taxonomy. Freeman, San Francisco.
100. Sorensen T (1948) A method to establish groups of equal amplitude in plant sociology based on the dissimilarity of species content and the applications of the analysis of the vegetation of danish common. Biologiske Skrifter 5(4): 1-34.