Automatic clustering approach based on particle swarm optimization for data with arbitrary shaped clusters
- Authors
- Chen, Geng-Bin; Song, An; Zhang, Chun-Ju; Liu, Xiao-Fang; Chen, Wei-Neng; Zhan, Zhi-Hui; Zhong, Jing-Hui; Zhang, Jun; Hu, Xiao-Min
- Issue Date
- Mar-2017
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Evolutionary algorithm; Multiple prototypes; Particle swarm optimization (PSO); Partitional clustering; Prototype-based encoding
- Citation
- 2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP), pp 41 - 48
- Pages
- 8
- Indexed
- SCI
SCOPUS
- Journal Title
- 2016 Seventh International Conference on Intelligent Control and Information Processing (ICICIP)
- Start Page
- 41
- End Page
- 48
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116353
- DOI
- 10.1109/ICICIP.2016.7885913
- Abstract
- Recently, partitional clustering approaches based on Evolutionary Algorithms (EAs) have shown promising in solving the data clustering problems. However, with the nearest prototype (NP) rule as the method for decoding, most of them are only suitable for clustering datasets with convex (e.g. hyperspherical) clusters. In this paper, we propose an automatic clustering approach using particle swarm optimization (PSO). A new encoding scheme with a novel decoding method, named the nearest multiple prototypes (NMP) rule, is applied to the PSO-based clustering algorithm to automatically determine an appropriate number of clusters in the procedure of clustering and partition datasets with arbitrary shaped clusters. The algorithm is experimentally validated on both synthetic and real datasets. The results show that the proposed PSO-based approach is very competitive when comparing with two popular clustering algorithms. © 2016 IEEE.
- Files in This Item
-
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.