loading...
An ACO-based Approach to Improve C-means Clustering Algorithm
Sydney Australia November 28-December 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIMCA.2006.38International Conference on Computati ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wenliang Huang, Zhejiang University, Hangzhou
Jin Gou, Huaqiao University, Quanzhou
Huifeng Wu, HangZhou Dianzi University, Huzhou
This paper presents an improved C-means clustering algorithm based on ACO. The proposed method use pheromone to evaluate individual colony's iterative result. In contrast with the existing C-means clustering algorithm, method in the paper need not appoint the number and pre-centers of clusters beforehand and it updates pheromone according to the transfer process of data points among different temporary clusters so as to avoid the local optima and reduce the iterative times to find actual cluster centers. We test its convergence performance with CRM data sets from China Unicom Corp. The experimental results show feasibility of design rationale.
Citation:
Wenliang Huang, Jin Gou, Huifeng Wu, "An ACO-based Approach to Improve C-means Clustering Algorithm," cimca, pp.12, International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions