An efficient clustering algorithm based on local optimality of K-means

DOI10.3724/SP.J.1001.2008.01683MaRDI QIDQ3406357zbMATH OpenOpenAlexFDO

Authors Xiaofeng Lei, Kunqing Xie, Fan Lin, Zhengyi Xia

Publication date 12 February 2010

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2008.01683

zbMATH Keywords

\(K\)-Meansclusteringconnectivity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• An effective \(k\)-means algorithm based on local density
• A K-means clustering algorithm based on a novel approach for improved initial seeds
• An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
• A K-means algorithm for document clustering with optimal initial values
• An efficient enhanced \(k\)-means clustering algorithm

Cited in

(6)

• Degeneracy on \(K\)-means clustering
• Multi-level \(k\)-means clustering algorithm based on minimum spanning tree and its application in data mining
• An effective \(k\)-means algorithm based on local density
• A novel method for optimizing spectral rotation embedding K-means with coordinate descent
• Fast global k-means clustering using cluster membership and inequality
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal

This page was built for publication: An efficient clustering algorithm based on local optimality of \(K\)-means

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