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.