A cluster problem as defined by nearest neighbours
From MaRDI portal
Publication:4488797
DOI10.2307/3316135zbMath0949.60030OpenAlexW2035264825MaRDI QIDQ4488797
E. G. Enns, T. Misi, P. Frank Ehlers
Publication date: 9 July 2000
Published in: Canadian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c2387e5b0ac5483442a3ead16af717b61cfb770b
Related Items (2)
On the number of weakly connected subdigraphs in random \(k\)NN digraphs ⋮ On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
Cites Work
- On the reciprocity of proximity relations
- Nearest neighbors and Voronoi regions in certain point processes
- Multiple clusters on the line
- Nearest neighbors and Voronoi volumes in high-dimensional point processes with various distance functions
- Reflexive Nearest Neighbours
- Random minimal trees
- Nearest neighbours in a Poisson ensemble
This page was built for publication: A cluster problem as defined by nearest neighbours
