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

DOI10.1016/S0167-7152(02)00421-2zbMath1101.62351MaRDI QIDQ1423266

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

Publication date: 14 February 2004

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

ClusteringMinimal spanning treeNearest neighbors graph

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Monte Carlo methods (65C05)

Related Items (10)

A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set ⋮ Shannon’s entropy of partitions determined by hierarchical clustering trees in asymmetry and dimension identification ⋮ Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model ⋮ A graph-theoretical clustering method based on two rounds of minimum spanning trees ⋮ Unnamed Item ⋮ Bootstrap percolation in random geometric graphs ⋮ Connectivity of random k-nearest-neighbour graphs ⋮ Continuum percolation with unreliable and spread-out connections ⋮ Highly connected random geometric graphs ⋮ Edge integrity of nearest neighbor graphs and separator theorems

Uses Software

• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph-theoretic measures of multivariate association and prediction
• A multivariate two-sample test based on the number of nearest neighbor type coincidences
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• Parallel concepts in graph theory
• Graph-theoretic procedures for dimension identification
• A strong law for the longest edge of the minimal spanning tree
• Multivariate Two-Sample Tests Based on Nearest Neighbors
• Generalization of the Gap Test for the Detection of Multivariate Outliers
• Some Properties of the Range in Samples from Tukey's Symmetric Lambda Distributions
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.