Algorithms for K-means Clustering Problem with Balancing Constraint
k-means clustering has been widely applied in the field of Machine Learning and Pattern Recognition. This paper discussed the algorithm of its sub problem which requires that each divided subset size must have at least some given value. Firstly, given k centers, this paper presented an algorithm that assigned each point to one of the centers and proved that the solution value is minimized. Secondly, a 2-approximate algorithm is also presented by the sample technique. At last some UCI datasets were selected to verify our algorithm.
Algorithm Clustering k-means Balancing Constraint
Wang Shouqiang Chi Zengxiao Zhan Sheng
Department of Information Engineering, Shandong Jiaotong University, Jinan 250023, China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
3967-3972
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）