Cluster Identification in Nearest-Neighbor Graphs

DOI10.1007/978-3-540-75225-7_18zbMATH Open1142.68401OpenAlexW1593534758MaRDI QIDQ3520060FDOQ3520060

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

Recommendations

• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Cites Work

• Random Geometric Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• A graph-based estimator of the number of clusters
• Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
• Percolation
• Title not available (Why is that?)
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks

Cited In (10)

• Finding clique clusters with the highest betweenness centrality
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
• Graph Clustering using Effective Resistance
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• A cluster problem as defined by nearest neighbours
• Title not available (Why is that?)
• Discussion about properties of first nearest neighbor graphs
• Title not available (Why is that?)
• Spectral clustering based on local linear approximations

This page was built for publication: Cluster Identification in Nearest-Neighbor Graphs

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