摘要
针对K-means算法随机选取中心点而无法得到全局最优误差平方和SSE的问题,提出了一种基于移动网格技术的K-means中心点选取算法,该算法在明显减少K-means算法的迭代次数的同时,近似得到SSE的全局最优.
In order to solve the problem that K-means Algorithm cannot get global optimal SSE（sum of the squared error） by choosing centers randomly, this paper presents a new algorithm of choosing centers of K-means based on shifting grid, which decreases iterative time of K-means obviously and gets the global optimal of SSE approximately.
出处
《微电子学与计算机》
CSCD
北大核心
2013年第6期101-104,共4页
Microelectronics & Computer
基金
国家自然科学基金项目(70701013)
