Cluster Identification in Nearest-Neighbor Graphs

DOI10.1007/978-3-540-75225-7_18MaRDI QIDQ3520060zbMATHOpenAlexFDO

Authors Markus Maier, Matthias Hein, Ulrike Von Luxburg

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(14)

• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions
• scientific article; zbMATH DE number 3902711 (Why is no real title available?)
• Graph Clustering using Effective Resistance
• scientific article; zbMATH DE number 5556003 (Why is no real title available?)
• A cluster problem as defined by nearest neighbours
• On nearest-neighbor graphs
• Spectral clustering based on local linear approximations
• Finding clique clusters with the highest betweenness centrality
• Discussion about properties of first nearest neighbor graphs
• A survey of neighborhood construction algorithms for clustering and classifying data points
• Dense neighborhoods on affinity graph
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights

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)