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

被引：152

作者：

Brito, MR

Chavez, EL

Quiroz, AJ

Yukich, JE

机构：

[1] UNIV SIMON BOLIVAR,DEPT MATH,CARACAS,VENEZUELA

[2] UNIV MICHOACANA,MORELIA,MICHOACAN,MEXICO

[3] UNIV SIMON BOLIVAR,CARACAS 1080,VENEZUELA

[4] LEHIGH UNIV,BETHLEHEM,PA

来源：

STATISTICS & PROBABILITY LETTERS | 1997年 / 35卷 / 01期

关键词：

mutual nearest neighbors; clustering; outlier detection;

D O I：

10.1016/S0167-7152(96)00213-1

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is proposed and its performance is evaluated in simulated data. (C) 1997 Elsevier Science B.V.

引用

页码：33 / 42

页数：10

共 13 条

[1]

Dudley R.M., 1984, Ecole d'ete de Probabilites de Saint-Flour XII-1982, V1097, P1, DOI DOI 10.1007/BFB0099432

[2]

Everitt B, 1974, CLUSTER ANAL

[3]

GONZALESBARRIOS JM, 1995, 19506 CIMAT

[4]

GOWDA KC, 1978, PATTERN RECOGN, V10, P105