A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree

Statistics and Probability Letters

Volumn 62, Issue 1, 2003, Pages 23-34

  González Barrios, José María ^a   Quiroz, Adolfo J ^b  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^b UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Clustering; Minimal spanning tree; Nearest neighbors graph

Indexed keywords

EID: 0037445514     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-7152(02)00421-2     Document Type: Article

References (20)

1. Brito, M.R., Quiroz, A.J., Yukich, J.E., 2002. Graph-theoretic procedures for dimension identification. J. Multivariate Anal. 81, 67-84.
2. Dudley, R.M., 1984. A course on empirical processes. In: Hennequin, P.L. (Ed.), Ecole d'eté de probabilités de St.-Flour. Lecture Notes in Mathematics, Vol. 1097, Springer, New York, pp. 1-142.
3. Everitt, B., 1974. Cluster Analysis. Heinemann, London.
4. Friedman, J.H., Rafsky, L.C., 1979. Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests. Ann. Statist. 17, 697-717.
5. Friedman, J.H., Rafsky, L.C., 1981. Graphics for the multivariate two-sample problem. J. Amer. Statist. Assoc. 76, 277-293.
6. Friedman, J.H., Rafsky, L.C., 1983. Graph-theoretic measures of multivariate association and prediction. Ann. Statist. 11 (2), 377-391.
7. Harary, F., 1969. Graph Theory. Addison-Wesley, Reading, MA.
8. Henze, N., 1988. A multivariate two-sample test based on the number of nearest neighbors type coincidences. Ann. Statist. 16 (2), 772-783.
9. Ihaka, R., Gentleman, R., 1996. R: A language for data analysis and graphics. J. Comput. Graphical Statist. 5 (3), 299-314.
10. Jain, A.K., Dubes, R.C., 1988. Algorithms for Clustering Data. Prentice-Hall Advanced Reference Series. Prentice-Hall, Englewood Cliffs, NJ.
11. Joiner, B.L., Rosenblatt, J.R., 1971. Some properties of the range in samples from Tukey's symmetric lambda distributions. J. Amer. Statist. Assoc. 66, 394-399.
12. Knuth, D.E., 1981. The Art of Computer Programming, 2nd Edition. Seminumerical Algorithms, Vol. 2 Addison-Wesley, Reading, MA.
13. Penrose, M.D., 1999. A strong law for the longest edge of the minimal spanning tree. Ann. Probab. 27 (1), 246-260.
14. Rohlf, F.J., 1975. Generalization of the gap test for the detection of multivariate outliers. Biometrics 31, 93-101.
15. Schilling, M.F., 1986. Multivariate two-sample tests based on nearest neighbors. J. Amer. Statist. Assoc. 81 (395), 799-806.
16. Scott, D.W., 1992. Multivariate Density Estimation. Theory, Practice and Visualization. Wiley series in Probability and Mathematical Statistics. Wiley, New York.
17. Tabakis, E., 1992. Asymptotic and computational problems in single-link clustering. Ph.D. Thesis, MIT.
18. Tabakis, E., 1996. On the longest edge of the minimal spanning tree. In: Gaul, W., Pfeifer, D. (Eds.), From Data to Knowledge. Springer, New York, pp. 222-230.
19. Wong, M.A., Lane, T., 1983. A kth nearest neighbour clustering procedure. J. Roy. Statist. Soc. Ser. B 45, 362-368.
20. Zahn, C.T., 1971. Graph-theoretical methods for detecting and describing Gestalt clusters. IEEE Trans. Comput. C 20, 68-86.