Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
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.
Year of publication: |
1997
|
---|---|
Authors: | Brito, M. R. ; Chávez, E. L. ; Quiroz, A. J. ; Yukich, J. E. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 35.1997, 1, p. 33-42
|
Publisher: |
Elsevier |
Keywords: | Mutual nearest neighbors Clustering Outlier detection |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Nearest neighbors methods for support vector machines
Camelo, S. A., (2015)
-
Laws of large numbers for classes of functions
Yukich, J. E., (1985)
-
Graph-Theoretic Procedures for Dimension Identification
Brito, María R., (2002)
- More ...