DocumentCode
3213634
Title
A Weighted Sum Validity Function for Clustering With BPSO Algorithm
Author
Changyin Sun ; Linfeng Li ; Derong Liu
Author_Institution
Coll. of Electr. Engingeering, Hohai Univ., Nanjing, China
fYear
2006
fDate
7-11 Aug. 2006
Firstpage
1830
Lastpage
1834
Abstract
In this paper, we suggest an objective function called the weighted sum validity function (WSVF), which is a weighted sum of the several normalized cluster validity functions. Further, a binary particle swarm optimization (BPSO) approach is proposed for automatically constructing the proper number of clusters as well as appropriate partitioning of the data set. And we hybridize the BPSO method with the k-means algorithm to optimize the WSVF automatically. In the experiments, we show the effectiveness of the WSVF and the validity of the BPSO. The BPSO can consistently and efficiently converge to the optimum corresponding to the given data in concurrence with the convergence result. The WSVF is found generally able to improve the confidence of clustering solutions and achieve more accurate and robust results.
Keywords
particle swarm optimisation; pattern clustering; BPSO algorithm; binary particle swarm optimization; clustering; data set partitioning; k-means algorithm; normalized cluster validity functions; objective function; weighted sum validity function; Automation; Clustering algorithms; Clustering methods; Data engineering; Educational institutions; Optimization methods; Particle swarm optimization; Partitioning algorithms; Robustness; Sun; Cluster validity; binary particle swarm optimization (BPSO); clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference, 2006. CCC 2006. Chinese
Conference_Location
Harbin
Print_ISBN
7-81077-802-1
Type
conf
DOI
10.1109/CHICC.2006.280866
Filename
4060414
Link To Document