Abstract
This paper proposes a coevolving Memetic clustering algorithm namely CoMCA for simultaneous partitional clustering and feature weighting. Particularly, CoMCA uses a coevolving particle swarm optimization (PSO) with two swarms for the global search of optimal combination of cluster centroids and feature weights. In each iteration of PSO, a local search based on K-means and gradient descent is introduced to fine-tune the best solution. Comparison study of CoMCA to K-means, PSO clustering, Fuzzy C-means, and WK-Means on test data demonstrates that CoMCA is robust in highlighting relevant features and attaining better (or competitive) performance than the other counterpart algorithms in terms of inter-cluster variance and Rand Index.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2013 IEEE Workshop on Memetic Computing, MC 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 |
Publisher | IEEE Computer Society |
Pages | 9-15 |
Number of pages | 7 |
ISBN (Print) | 9781467358910 |
DOIs | |
Publication status | Published - 2013 |
Event | 2013 2nd IEEE Workshop on Memetic Computing, MC 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 - Singapore, Singapore Duration: 16 Apr 2013 → 19 Apr 2013 |
Publication series
Name | Proceedings of the 2013 IEEE Workshop on Memetic Computing, MC 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 |
---|
Conference
Conference | 2013 2nd IEEE Workshop on Memetic Computing, MC 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 16/04/13 → 19/04/13 |
Bibliographical note
Copyright:Copyright 2014 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Science Applications