An optimization initial center K-means algorithm for text clustering

MaRDI QIDQ3051887zbMATH OpenFDO

Authors Haodong Zhu, Yong Zhong, Xianghui Zhao

Publication date 5 November 2010

zbMATH Keywords

initial centerK-means algorithmsimulated annealing algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Similarity matrix-based K-means algorithm for text clustering
• A K-means algorithm for document clustering with optimal initial values
• An optimized initial centers for fuzzy \(C\)-means algorithm
• A K-means optimal clustering algorithm based on complex
• scientific article; zbMATH DE number 7267213

Cited in

(5)

• Similarity matrix-based K-means algorithm for text clustering
• Mongolian near-element clustering via immune clone algorithm
• A method for K-means seeds generation applied to text mining
• A K-means optimal clustering algorithm based on complex
• A K-means algorithm for document clustering with optimal initial values

This page was built for publication: An optimization initial center K-means algorithm for text clustering

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