A cluster problem as defined by nearest neighbours

DOI10.2307/3316135MaRDI QIDQ4488797zbMATH OpenOpenAlexFDO

Authors Ernest Enns, P. Frank Ehlers, T. Misi

Publication date 9 July 2000

Published in The Canadian Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c2387e5b0ac5483442a3ead16af717b61cfb770b

zbMATH Keywords

connected clustersnearest neighboursstructure of a cluster

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Recommendations

• On nearest-neighbor graphs
• On nearest-neighbor graphs
• scientific article; zbMATH DE number 1222330
• \(k\)-nearest-neighbor clustering and percolation theory
• Cluster Identification in Nearest-Neighbor Graphs

Cites work

• Multiple clusters on the line
• Nearest neighbors and Voronoi regions in certain point processes
• Nearest neighbors and Voronoi volumes in high-dimensional point processes with various distance functions
• Nearest neighbours in a Poisson ensemble
• On the reciprocity of proximity relations
• Random minimal trees
• Reflexive Nearest Neighbours

Cited in

(8)

• On nearest-neighbor graphs
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs
• Discussion about properties of first nearest neighbor graphs
• scientific article; zbMATH DE number 5905610 (Why is no real title available?)
• scientific article; zbMATH DE number 3850307 (Why is no real title available?)
• On the number of reflexive and shared nearest neighbor pairs in one-dimensional uniform data
• On nearest-neighbor graphs
• Structural, Syntactic, and Statistical Pattern Recognition

This page was built for publication: A cluster problem as defined by nearest neighbours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488797)