DocumentCode
2632830
Title
Optimizing the Ant Clustering Model Based on K-Means Algorithm
Author
Chen, Qin ; Mo, Jinping
Author_Institution
Sch. of Comput., Electron. & Inf., Guangxi Univ., Nanning, China
Volume
3
fYear
2009
fDate
March 31 2009-April 2 2009
Firstpage
699
Lastpage
702
Abstract
Ant clustering is one of effective clustering methods. Compares to other clustering methods, ant clustering algorithm has one outstanding advantage and one disadvantage. The advantage is that the total numbers of cluster is generated automatically ,and the disadvantage is that its cluster result is random and its result is influenced by the input data and the parameters, which leads low quality of its cluster result. In this paper, we propose an improved ant clustering algorithm based on K-means, which optimizes the rules of ant clustering algorithm. In our system, we also decide the proper values of parameters Pdel and Iter by training the training datasets before we cluster. Experimental results demonstrate that the proposed method has a good performance.
Keywords
learning (artificial intelligence); optimisation; pattern clustering; K-means clustering algorithm; ant clustering algorithm optimization; machine learning; training dataset; Clustering algorithms; Clustering methods; Computer science; Data analysis; Machine learning; Machine learning algorithms; Partitioning algorithms; Pattern recognition; Random number generation; Statistical analysis; Ant Clustering Algorithm; K-Means; Parameters; Rules;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Engineering, 2009 WRI World Congress on
Conference_Location
Los Angeles, CA
Print_ISBN
978-0-7695-3507-4
Type
conf
DOI
10.1109/CSIE.2009.813
Filename
5170931
Link To Document