A New Cluster Analysis Based on Combinatorial Particle Swarm Optimization Algorithm
- DOI
- 10.2991/emcs-16.2016.114How to use a DOI?
- Keywords
- Particle swarm algorithm; Cluster analysis; Combinatorial optimization; K-means
- Abstract
Inspired by the swarm intelligence in self-organizing behavior of real Particle Swarm Optimization various Particle Swarm Optimization algorithms were proposed recently for many research fields in data mining such as clustering Compared with the previous clustering approaches such as K-means the main advantage of Particle Swarm Optimization based clustering algorithms is that no additional information is needed such as the initial partitioning of the data or the number of clusters In this paper, we discuss the clustering analysis way by a combination of advantages of particle swarm optimization in the clustering, since Particle Particle Swarm Optimization has the good global searching quickly. Firstly, the center and number of clustering are determined by using the Particle Swarm Optimization, and then the above clustering results are optimized by the K-means algorithm combining with the optimization algorithm. The simulated experiments show that the combining algorithm is obviously superior to some common clustering algorithms since it has obvious advantage in optimization capacity, more efficient and more robust than previous research such as the classical K-means clustering algorithm.
- Copyright
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Jin Jin AU - Zhong Ma AU - Lin Xue AU - Changhui Tian PY - 2016/01 DA - 2016/01 TI - A New Cluster Analysis Based on Combinatorial Particle Swarm Optimization Algorithm BT - Proceedings of the 2016 International Conference on Education, Management, Computer and Society PB - Atlantis Press SP - 476 EP - 479 SN - 2352-538X UR - https://doi.org/10.2991/emcs-16.2016.114 DO - 10.2991/emcs-16.2016.114 ID - Jin2016/01 ER -