Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
Authors:
- M.R. BritoMBM.R. Brito
- E.L. ChávezECE.L. Chávez
- A.J. QuirozAQA.J. Quiroz
- J.E. YukichJYJ.E. Yukich
- 1 August 1997
- journal article
- Published by Elsevier in Statistics & Probability Letters
- Vol. 35 (1) , 33-42
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An Examination of Procedures for Determining the Number of Clusters in a Data SetPsychometrika, 1985
- A Kth Nearest Neighbour Clustering ProcedureJournal of the Royal Statistical Society Series B: Statistical Methodology, 1983
- A Hybrid Clustering Method for Identifying High-Density ClustersJournal of the American Statistical Association, 1982
- Agglomerative clustering using the concept of mutual nearest neighbourhoodPattern Recognition, 1978
- Clustering Using a Similarity Measure Based on Shared Near NeighborsIEEE Transactions on Computers, 1973
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971