Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection

Statistics and Probability Letters

Volumn 35, Issue 1, 1997, Pages 33-42

  Brito, M R ^a   Chavez E L ^b   Quiroz, A J ^b   Yukich, J E ^b  

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

^b NONE

Author keywords

Clustering; Mutual nearest neighbors; Outlier detection

Indexed keywords

EID: 0031571391     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-7152(96)00213-1     Document Type: Article

References (13)

1. Dudley, R.M. (1984), Ecole d'eté de probabilités de St.-Flour, Lecture Notes in Math., Vol. 1097 (Springer, New York) pp. 1-142.
2. Everitt, B. (1974), Cluster Analysis (Heinemann, London).
3. González-Barrios, J.M. and A.J. Quiroz (1995), When does the k-nearest neighbors graph contain the MST? Comunicación Técnica del CIMAT No. 1-95-06.
4. Gowda, K.C. and G. Krishna (1978), Agglomerative clustering using the concept of mutual nearest neighborhood. Pattern Recognition 10, 105-112.
5. Harary, F. (1969), Graph Theory (Addison-Wesley, Reading, MA).
6. Hartigan, J. (1975), Clustering Algorithms (Wiley, New York).
7. Jain, A.K. and R.C. Dubes (1988), Algorithms for Clustering Data, Prentice Hall Advanced Reference Series (Prentice Hall, Englewood Cliffs, NJ).
8. Jarvis, R.A. and E.A. Patrick (1973), Clustering using a similarity measure based on shared near neighbors, IEEE Trans. Comput. C 22, 1025-1034.
9. Knuth, D.E. (1981), The Art of Computer Programming (Addison-Wesley, Reading, MA, 2nd ed.).
10. Milligan, G.W. and M.C. Cooper (1985), An examination of procedures for determining the number of clusters in a data set, Psychometrica 50, 159-179.
11. Wong, M.A. (1982), A hybrid clustering method for identifying high density clusters, J. Amer. Statist. Assoc. 77, 841-847.
12. Wong, M.A. and T. Lane (1983), A k-th nearest neighbour clustering procedure, J. Roy. Statist. Soc., Ser. B 45, 362-368.
13. Zahn, C.T. (1971), Graph-theoretical methods for detecting and describing Gestalt clusters, IEEE Trans. Comput. C 20, 68-86.