Algorithms for K-means clustering problem with balancing constraint

Authors:
Wang Shouqiang;Chi Zengxiao;Zhan Sheng
Affiliations:
Department of Information Engineering, Shandong Jiaotong University, Jinan, China;Department of Information Engineering, Shandong Jiaotong University, Jinan, China;Department of Information Engineering, Shandong Jiaotong University, Jinan, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 6
Cited 0

Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Randomized algorithms

Randomized algorithms
A k-Median Algorithm with Running Time Independent of Data Size

Machine Learning
A local search approximation algorithm for k-means clustering

Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
A Simple Linear Time (1+ ") -Approximation Algorithm for k-Means Clustering in Any Dimensions

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Scalable Clustering Algorithms with Balancing Constraints

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.