A K-means optimal clustering algorithm based on complex

MaRDI QIDQ3642387zbMATH OpenFDO

Authors Kai Zhao, Shengjin Li, Feng Zhao

Publication date 11 November 2009

zbMATH Keywords

complex methoddata miningK-means clustering

Mathematics Subject Classification ID

Database theory (68P15) Pattern recognition, speech recognition (68T10)

Recommendations

• An improved K-means clustering algorithm
• An optimization initial center K-means algorithm for text clustering
• A \(k\)-means algorithm to optimize the initial cluster centers
• An improved K-means clustering algorithm based on Leader algorithm
• \(k\)-means algorithm

Cited in

(5)

• An optimization initial center K-means algorithm for text clustering
• k-means cluster algorithm based on artificial immune net
• An enhanced Wu-Huberman algorithm with pole point selection strategy
• A chaotic moth flame optimization algorithm based on dimension learning and quadratic interpolation
• K-means clustering algorithm based on flower pollination algorithm

This page was built for publication: A K-means optimal clustering algorithm based on complex

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