A K-means algorithm for document clustering with optimal initial values

MaRDI QIDQ5319195zbMATH OpenFDO

Authors Yuanyuan Chen, Zhiyi Qu, Henglong Zhang, Shaowen Liao

Publication date 22 July 2009

zbMATH Keywords

\( K\)-meansdocument clusteringpartition-based clustering algorithmvector space model

Mathematics Subject Classification ID

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

Recommendations

• An improved k-means algorithm for document clustering
• Similarity matrix-based K-means algorithm for text clustering
• An effective \(k\)-means algorithm based on local density
• An optimization initial center K-means algorithm for text clustering
• A K-means clustering algorithm based on a novel approach for improved initial seeds

Cited in

(12)

• A new hybrid algorithm for document clustering based on cuckoo search and K-means
• Clustering parameters selection algorithm based on density for divisional clustering process
• Similarity matrix-based K-means algorithm for text clustering
• An optimization initial center K-means algorithm for text clustering
• A method for K-means seeds generation applied to text mining
• An efficient clustering algorithm based on local optimality of K-means
• Document clustering using a modified differential evolution algorithm
• A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
• Document clustering of fuzzy c-means based on black hole algorithm
• scientific article; zbMATH DE number 2113999 (Why is no real title available?)
• An effective \(k\)-means algorithm based on local density
• An improved k-means algorithm for document clustering

This page was built for publication: A \(K\)-means algorithm for document clustering with optimal initial values

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