Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample

Journal of Classification

Volumn 20, Issue 1, 2003, Pages 25-47

  Stuetzle, Werner ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Mixture models; Nearest neighbor density estimation; Runt test; Single linkage clustering; Two way, Two mode data

Indexed keywords

EID: 0037560966     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00357-003-0004-6     Document Type: Article

References (33)

1. ANKERST, M., BREUNING, M.M., KRIEGEL, H.P., and SANDER, J. (1999), "Optics: Ordering Points to Identify the Clustering Structure", Proceedings, ACM SIGMOD International Conference on Management of Data (SIGMOD'99), 49-60.
2. BALLARD. D.H., and BROWN, C.M. (1982), "Computer Vision", Prentice Hall.
3. BENTLEY, J.L., and FRIEDMAN, J.H. (1978), "Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces", IEEE Transactions on Computers, C-27(2), 97-105.
4. CUTTING, D.R., KARGER, D.R., and PEDERSEN, J.O. (1993), "Constant Interaction Time Scatter/Gather Browsing of Very Large Document Collections", Proceedings, Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 126-134.
5. CUTTING, D.R., KARGER, D.R., PEDERSEN, J.O., and TUKEY, J.W. (1992), "Scatter/Gather: A Cluster-Based Approach to Browsing Large Document Collections", Proceedings, Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 318-329.
6. ESTER, M., KRIEGEL, H.P., SANDER, J., and Xu, X. (1996), "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231, 1996.
7. FRALEY, C., and RAFTERY, A. (1998), "How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis", The Computer Journal, 41, 578-588.
8. FRALEY, C. and RAFTERY, A. (1999), "McLust: Software for Model-Based Cluster Analysis", Journal of Classification, 16, 297-306.
9. FRIEDMAN, J.H. (1987), "Exploratory Projection Pursuit", Journal of the American Statistical Association, 82, 249-266.
10. FRIEDMAN, J.H., STUETZLE, W., and SCHROEDER, A. (1984), "Projection Pursuit Density Estimation", Journal of the American Statistical Association, 79, 599-608.
11. FRIEDMAN, J.H., and TUKEY, J.W. (1974), "A Projection Pursuit Algorithm for Exploratory Data Analysis", IEEE Transactions on Computers, C-23, 881-890.
12. GNANADESIKAN, R., KETTENRING, J.R., and LANDWEHR, J.M. (1982), "Projection Plots for Displaying Clusters", in Statistics and Probability: Essays in Honor of C. R. Rao, Elsevier/N.Holland, 269-280.
13. GOWER, J.C., and ROSS, G.J.S. (1969), "Minimal Spanning Trees and Single Linkage Cluster Analysis", Applied Statistics, 18, 54-64.
14. HARTIGAN, J.A. (1975), "Clustering Algorithms", Wiley.
15. HARTIGAN, J.A. (1981), "Consistency of Single Linkage for High-Density Clusters. Journal of the American Statistical Association, 76, 388-394.
16. HARTIGAN, J.A. (1985), "Statistical Theory in Clustering", Journal of Classification, 2, 63-76.
17. HARTIGAN, J.A., and HARTIGAN, P.M. (1985), "The DIP Test of Unimodality", Annals of Statistics, 13, 70-84.
18. HARTIGAN, J.A., and MOHANTY, S. (1992), "The RUNT Test for Multimodality", Journal of Classification, 9, 63-70.
19. HUBERT, L., and ARABIE, P. (1985), "Comparing Partitions", Journal of Classification, 2, 193-218.
20. MACQUEEN, J. (1967), "Some Methods for Classification and Analysis of Multivariate Observations", in Proceedings of the 5th Berkeley Symposium on Mathematics, Statistics and Probability, 1, 281-296.
21. MARDIA, K., KENT, J., and BIBBY, J. (1979), "Multivariate Analysis", Academic Press.
22. MCLACHLAN, G.J., and Peel, D. (2000), "Finite Mixture Models", Wiley.
23. NENE, S.A., and NAYAR, S.K. (1997), "A Simple Algorithm for Nearest Neighbor Search in High Dimensions", IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, 989-1003.
24. PRIM, R.C. (1957), "Shortest Connection Matrix Network and Some Generalizations", Bell Systems Technical Journal, 36, 1389-1401.
25. ROZÁL, G.P.M., and HARTIGAN, J.A. (1994), "The MAP test for Multimodality", Journal of Classification, 11, 5-36.
26. SCHWARTZ, G. (1978), "Estimating the Dimension of a Model", Annals of Statistics, 6, 461-464.
27. SHAO, J., and TU, D. (1995), "The Jackknife and Bootstrap", Springer.
28. SILVERMAN, B.W. (1986), "Density Estimation for Statistics and Data Analysis", Chapman & Hall.
29. SWAYNE, D.F., COOK, D., and BUJA, A. (1998), "Xgobi: Interactive Dynamic Data Visualization in the X Window System", Journal of Computational and Graphical Statistics, 7, 113-130.
30. TUKEY, P.A., and TUKEY, J.W. (1989), "Data Driven View Selection, Agglomeration, and Sharpening", in Interpreting Multivariate Data, Ed., V. Barnett, Wiley, 215-243.
31. WISHART, D. (1969), "Mode Analysis: A Generalization of Nearest Neighbor which Reduces Chaining Effects", in Numerical Taxonomy, Ed., A. J. Cole, Academic Press, 282-311.
32. WONG, M.A. (1979), "Hybrid Clustering", PhD thesis, New Haven CT: Department of Statistics, Yale University.
33. WONG, M.A., and LANE, T. (1983), "A kth Nearest Neighbor Clustering Procedure", Journal of the Royal Statistical Society, Series B, 45, 362-368.