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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph-theoretic procedures for dimension identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic measures of multivariate association and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multivariate two-sample test based on the number of nearest neighbor type coincidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of the Range in Samples from Tukey's Symmetric Lambda Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong law for the longest edge of the minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of the Gap Test for the Detection of Multivariate Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate Two-Sample Tests Based on Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3319619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank

Latest revision as of 13:58, 6 June 2024

scientific article
Language Label Description Also known as
English
A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
scientific article

    Statements

    A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (English)
    0 references
    14 February 2004
    0 references
    Nearest neighbors graph
    0 references
    Minimal spanning tree
    0 references
    Clustering
    0 references

    Identifiers