Balanced K-means

Abstract

K-Means is a very common method of unsupervised learning in data mining. It is introduced by Steinhaus in 1956. As time flies, many other enhanced methods of k-Means have been introduced and applied. One of the significant characteristic of k-Means is randomize. Thus, this paper proposes a balanced k-Means method, which means number of items distributed within clusters are more balanced, provide more equal-sized clusters. Cases those are suitable to apply this method are also discussed, such as Travelling Salesman Problem (TSP). In order to enhance the performance and usability, we are in the process of proposing a learning ability of this method in the future.