A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
type: Item
instance of: scholarly article
title: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
zbMATH Open document ID: 1101.62351
DOI: 10.1016/S0167-7152(02)00421-2
author: José M. González-Barrios
author: A. J. Quiroz
published in: Statistics \& Probability Letters
publication date: 2004-02-14T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 2041708
zbMATH Keywords: Nearest neighbors graph
zbMATH Keywords: Minimal spanning tree
zbMATH Keywords: Clustering
describes a project that uses: R
MaRDI profile type: Publication
cites work: Graph-theoretic procedures for dimension identification
cites work: Q3217346
cites work: Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
cites work: Graph-theoretic measures of multivariate association and prediction
cites work: Parallel concepts in graph theory
cites work: A multivariate two-sample test based on the number of nearest neighbor type coincidences
cites work: Q3994557
cites work: Some Properties of the Range in Samples from Tukey's Symmetric Lambda Distributions
cites work: Q3935355
cites work: A strong law for the longest edge of the minimal spanning tree
cites work: Generalization of the Gap Test for the Detection of Multivariate Outliers
cites work: Multivariate Two-Sample Tests Based on Nearest Neighbors
cites work: Q4863755
cites work: Q4866182
cites work: Q4887376
cites work: Q3319619
cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
description: scientific article; zbMATH DE number 2041708