Cluster Identification in Nearest-Neighbor Graphs
From MaRDI portal
Publication:3520060
DOI10.1007/978-3-540-75225-7_18zbMath1142.68401OpenAlexW1593534758MaRDI QIDQ3520060
Ulrike von Luxburg, Matthias Hein, Markus Maier
Publication date: 19 August 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0013-CDCB-6
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Spectral clustering based on local linear approximations, Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
Cites Work
- Unnamed Item
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- Percolation
- Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks
- Random Geometric Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- A graph-based estimator of the number of clusters