Computer Science ›› 2009, Vol. 36 ›› Issue (7): 175-178.doi: 10.11896/j.issn.1002-137X.2009.07.041
Previous Articles Next Articles
LEI Xiao-feng,YANG Yang,ZHANG Ke,XIE Kun-qing,XIA Zheng-yi
Online:
Published:
Abstract: The clustering problems based on minimizing the sum of intra-cluster squared-error are known to be NP-hard. I}he iterative relocating method using by K-Means is essentially a kind of local hill-climbing algorithm, which will find a locally minimal solution eventually and cause much sensitivity to initial representatives. The meta-heuristic strategy was introduced to minimize the squared-error criterion globally. Firstly, an evaluation function was built to approximate the dependency between a series of initial representatives of K-Means and the local minimal of objective criterion,and then the selection of initial representatives was done under the supervision of the evaluation function for the next K-Means. This iterative and self-learning process is called Meta KMeans algorithm. The experimental demonstrations show that Meta K-Means can overcome the sensitivity to initial representatives of K-Means to a great extent.
Key words: K-Means algorithm, Metaheuristic, Iterative self-learning framework
LEI Xiao-feng,YANG Yang,ZHANG Ke,XIE Kun-qing,XIA Zheng-yi. Metaheuristic Strategy Based K-Means with the Iterative Self-Learning Framework[J].Computer Science, 2009, 36(7): 175-178.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/10.11896/j.issn.1002-137X.2009.07.041
https://www.jsjkx.com/EN/Y2009/V36/I7/175
Cited