Indexed dendrograms on random dissimilarities

Journal of Classification

Volumn 15, Issue 1, 1998, Pages 93-127

  Van Cutsem, Bernard ^a   Ycart, Bernard ^a  

^a Laboratoire de Modelisation et Calcul   (France)

Author keywords

Average link; Chaining; Classifiability testing; Complete link; Hierarchical classification; Indexed dendrograms; Single link

Indexed keywords

EID: 0032380904     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003579900022     Document Type: Article

References (36)

1. ABRAHAM, C. T. (1964), "Evaluation of Clusters on the Basis of Random Graph Theory," IBM Research Report, RC-1177, IBM, Yorktown Heights, NY.
2. BENZÉCRI, J. P. (1973), L'analyse des données. I. La taxinomie, Paris: Dunod.
3. BOCK, H. H. (1985), "On Some Significance Tests in Cluster Analysis," Journal of Classification, 2, 77-108.
4. BOCK, H. H. (1996a), "Probabilistic Models in Partitional Cluster Analysis." Computational Statistics and Data Analalysis, to appear.
5. BOCK, H. H. (1996b), "Probability Models and Hypotheses Testing in Partitioning Cluster Analysis," in Clustering and Classification, Eds., P. Arabie, L.J. Hubert, and G. De Soete, River Edge, NJ.: World Scientific, 377-453.
6. BOLLOBAS, B. (1985), Random Graphs, London: Academic Press.
7. BOORMAN, S. A., and OLIVIER, D. C. (1973), "Metrics on Spaces of Finite Trees," Journal of Mathematical Psychology. 10, 26-59.
8. COMTET, L. (1974), Advanced Combinatorics, Dordrecht: Reidel.
9. CRITCHLEY, F., and FICKET, B. (1994), "The Partial Order by Inclusion of the Principal Classes of Dissimilarity on a Finite Set, and Some of Their Basic Properties," in Classification and Dissimilarity Analysis, Ed., B. Van Cutsem, Lecture Notes in Statistics, 93, New York: Springer-Verlag, 5-66.
10. CRITCHLEY, F., and VAN CUTSEM, B. (1994), "An Order-Theoretic Unification and Generalisation of Certain Fundamental Bijections in Mathematical Classification, Parts I and II," in Classification and Dissimilarity Analysis, Ed., B. Van Cutsem, Lecture Notes in Statistics, 93, New York: Springer-Verlag, 87-148.
11. ERDOS, P., and RENYI, A. (1960), "On the Evolution of Random Graphs," Matematikai Kutató Intézel Közlemënyei, 5, 17-61.
12. FLOREK, K. J., LUKASZEWICZ, J., PERKAL. J., STEINHAUS, H., and ZUBRZYCKI, S. (1951a), "Sur la liaison et la division des points d'un ensemble fini," Colloquium Mathematicum, 2, 282-285.
13. FLOREK, K. J., LUKASZEWICZ, J., PERKAL, J., STEINHAUS, H., and ZUBRZYCKI, S. (1951b), "Taksonomia Wroslawska," Przeglad Antropologiczny, 17, 193-211.
14. FRANK, O., and SVENSSON, K. (1981), "On Probability Distributions of Single-Linkage Dendrograms," Journal, of Statistical Computation and Simulation, 12, 121-131.
15. GILBERT, E. N. (1959), "Random Graphs," Annals of Mathematical Statistics, 30, 1141-1144.
16. GODEHARDT, E. (1988), Graphs as Structural Models, Braunschweig/Wiesbaden: Vieweg.
17. GORDON, A. D. (1981), Classification, London: Chapman & Hall.
18. GORDON, A. D. (1987), "A Review of Hierarchical Classification," Journal of the Royal Statistical Society, A. 150, 119-137.
19. GORDON, A. D. (1996), "Hierarchical Classification," in Clustering and Classification, Eds., P. Arabie, L.J. Hubert, and G. De Soete, River Edge, NJ.: World Scientific, 65-121.
20. HARTIGAN, J. A. (1967), "Representations of Similarity Matrices by Trees," Journal of the American Statistical Association, 62, 1140-1158.
21. HARTIGAN, J. A., and MOHANTY, S. (1992), "The RUNT Test for Multimodality," Journal of Classification, 9, 63-70.
22. HOFRI, M. (1987), Probabilistic Analysis of Algorithms, New York: Springer-Verlag.
23. JAIN, A. K., and DUBES, R. C. (1988), Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall.
24. JANSON, S., KNUTH, D. E., LUCZAK, T., and PITTEL, B. (1993), "The Birth of the Giant Component," Random Structures and Algorithms, 4, 233-258.
25. JARDINE, C. J., JARDINE, N., and SIBSON, R. (1967), "The Structure and Construction of Taxonomic Hierarchies," Mathematical Biosciences, 1, 171-179.
26. JOHNSON, S. C. (1967), "Hierarchical Clustering Schemes," Psychometrika, 32, 241-254.
27. LING, R. F. (1973a), "A Probability Theory of Cluster Analysis," Journal of the American Statistical Association, 68, 159-164.
28. LING, R. F. (1973b), "The Expected Number of Components in Random Linear Graphs," Annals of Probability, 1, 876-881.
29. LING, R. F., and KILLOUGH, G. G. (1976), "Probability Tables for Cluster Analysis Based on a Theory of Random Graphs," Journal of the American Statistical Association, 71, 293-300.
30. MURTAGH, F. (1983), "A Probability Theory of Hierarchic Clustering Using Random Dendrograms." Journal of Statistical Computation and Simulation, 18, 145-157.
31. PEKÖZ, E. A., and ROSS, S. M. (1994), "Improving Poisson Approximations," Probability in the Engineering and Informational Sciences, 8, 449-462.
32. SNEATH, P. H. (1957), "The Application of Computers to Taxonomy," Journal of Geneneral Microbiology, 17, 184-200.
33. SNEATH, P. H., and SOKAL, R. R. (1973), Numerical Taxonomy, San Francisco: Freeman.
34. SOKAL, R. R., and MICHENER, C. D. (1958), "A Statistical Method for Evaluating Systematic Relationships," University of Kansas Science Bulletin, 38, 1409-1438.
35. SPENCER, J. H. (1993), "Nine Lectures on Random Graphs," in Ecole d'été de probabilités de Saint-Flour XXI-1991, Ed., P. L. Hennequin, Lecture Notes in Mathematics, 1541, New York: Springer-Verlag, 293-347.
36. VAN CUTSEM, B., and YCART, B. (1996), "Probability Distributions on Indexed Dendrograms and Related Problems of Classifiability," in Data Analysis and Information Systems, Ed., H. H. Bock, Berlin: Springer-Verlag, 73-87.