Computational intelligence-based personalization of interactive web systems
WSEAS Transactions on Information Science and Applications
A clustering algorithm FCM-ACO for supplier base management
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
| Hi-index | 0.00 |
This paper deals with clustering by optimizing the c-means clustering model. For some data sets this clustering model possesses many local optima, so conventional alternating optimization (AO) will produce bad results. For obtaining good clustering results, the minimization procedure has to be kept from being trapped in these local optima, for example, by stochastic optimization approaches. Recently, we showed that ant colony optimization (ACO) can be effectively applied to the c-means clustering model. In this paper, we introduce a wasp swarm optimization (WSO) algorithm to optimize the c-means clustering model. In experiments with four benchmark data sets, the new WSO clustering algorithm is compared with AO and ACO. For data sets leading to c-means models without local optima, both WSO and AO perform better and faster than ACO. For data sets leading to multiple local optima, WSO clearly outperforms both AO and ACO. © 2008 Wiley Periodicals, Inc.