Clustering with a Weighted Sum Validity Function Using a Niching PSO Algorithm

• Published in: 2007 IEEE International Conference on Networking, Sensing, and Control : London, United Kingdom, April 15-17, 2007 pp. 368 - 373
• Main Authors: Changyin Sun, Hua Liang, Linfeng Li, Derong Liu
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.04.2007
• Subjects: Automation; Cluster validity; clustering; Clustering algorithms; Clustering methods; Computer networks; Educational institutions; Electronic mail; niching; Particle swarm optimization; Partitioning algorithms; Sun; USA Councils
• ISBN: 1424410754; 9781424410750
• DOI: 10.1109/ICNSC.2007.372807

In this paper, we will consider an objective function called the weighted sum validity function (WSVF), which is a weighted sum of several normalized cluster validity functions. In contrast to optimization techniques intended to find a single, global solution in a problem domain, niching techniques have the ability to locate multiple solutions in multimodal domains. Hence, a niching binary particle swarm optimization (NBPSO) approach is developed for automatically constructing the proper number of clusters as well as appropriate partitioning of the data set. We also hybridize the NBPSO method with the k-means algorithm to optimize the WSVF automatically. In experiments, we show the effectiveness of the WSVF and the validity of the NBPSO. In comparison with other related PSO, the NBPSO 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.