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

José María González-Barrios and Adolfo J. Quiroz

Statistics & Probability Letters, 2003, vol. 62, issue 1, 23-34

Abstract: We present a procedure for the identification of clusters in multivariate data sets, based on the comparison between the k nearest neighbors graph, Gk, and the minimal spanning tree, MST. Our key statistic is the random quantity the smallest k such that Gk contains the MST. Under regularity assumptions, we show that for i.i.d. data from a density on with compact support having one connected component, , where n denotes sample size, a bound that seems to be sharp, according to simulations. This leads to a consistent test for the identification of crisp clusters. We illustrate the use of our procedure with an example.

Keywords: Nearest; neighbors; graph; Minimal; spanning; tree; Clustering (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(02)00421-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:62:y:2003:i:1:p:23-34

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().