DocumentCode
2803644
Title
Balance K-Means Algorithm
Author
Wang, Hongjun ; Qi, Jianhuai ; Zheng, Weifan ; Wang, Mingwen
Author_Institution
Inf. Res. Inst., SouthWest Jiaotong Univ., Chengdu, China
fYear
2009
fDate
11-13 Dec. 2009
Firstpage
1
Lastpage
3
Abstract
K-means is the most popular clustering algorithm and many researchers pay much attention to improving it. In this paper the authors find that some features influence so much on the results of clustering. For improving the K-means algorithm, the authors design a novel balance K-means algorithm. The main idea is that we normalize all the feature values of dataset before clustering. So all the features play the same important role in the clustering, which make the k-means balanced. There are three contributions to this paper. First the disadvantages of the standard K-means are illustrated in detail. Second we design the balance K-means algorithm which all the values of features are projected into a fix range, so it can take over the disadvantage of the standard K-means and. At last the authors choose some datasets from UCI for experiments. And the results of experiments show that the balance K-means runs better than the standard K-means.
Keywords
pattern clustering; balance k-means algorithm; clustering algorithm; dataset feature values normalization; standard K-means disadvantages; Algorithm design and analysis; Clustering algorithms; Clustering methods; Neural networks; Partitioning algorithms; Statistics; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4507-3
Electronic_ISBN
978-1-4244-4507-3
Type
conf
DOI
10.1109/CISE.2009.5362578
Filename
5362578
Link To Document