Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions

zbMATH Open1235.68134MaRDI QIDQ2880892FDOQ2880892

Authors Sébastien Bubeck, Ulrike Von Luxburg

Publication date 17 April 2012

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://www.jmlr.org/papers/v10/bubeck09a.html

zbMATH Keywords

clusteringconsistencyminimizing objective functions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Consistency of spectral clustering
• Cluster Identification in Nearest-Neighbor Graphs
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• A Sober Look at Clustering Stability
• scientific article; zbMATH DE number 4007494

Cited in

(6)

• Riding down the Bay: space-time clustering of ecological trends
• Quantile-based clustering
• SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
• A statistical view of clustering performance through the theory of \(U\)-processes
• Exhaustivek-nearest-neighbour subspace clustering
• Semi-supervised learning using ensembles of multiple 1D-embedding-based label boosting

This page was built for publication: Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions

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