Batch edge-removal clustering based on random kNN graph

DOI10.13328/J.CNKI.JOS.005327MaRDI QIDQ5382001zbMATH OpenOpenAlexFDO

Authors Xiaofeng Lei, Jiao Chen, Shanjun Mao, Kunqing Xie

Publication date 21 June 2019

Full work available at URL http://www.jos.org.cn/html/2018/12/5327.htm

zbMATH Keywords

adjacent graphbatched edge-remove clusteringedge-remove criterionlocal Gaussian smoothingrandom $k$NN graph

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Recommendations

• Clustering with \(r\)-regular graphs
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• scientific article; zbMATH DE number 2089226
• scientific article; zbMATH DE number 278992
• Improved algorithms for the random cluster graph model

This page was built for publication: Batch edge-removal clustering based on random $k$NN graph

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