Volume 14, Issue 2 (9-2017)                   JSDP 2017, 14(2): 159-169 | Back to browse issues page

DOI: 10.18869/acadpub.jsdp.14.2.159

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Chaghari A, Feizi-Derakhshi M. Automatic Clustering Using Improved Imperialist Competitive Algorithm. JSDP. 2017; 14 (2) :159-169
URL: http://jsdp.rcisp.ac.ir/article-1-453-en.html

PhD Candidate University of Tabriz
Abstract:   (292 Views)

Imperialist Competitive Algorithm (ICA) is considered as prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optimal clustering of the data simultaneously .To increase the accuracy and speed of convergence, the structure of ICA changes. The proposed algorithm requires no background knowledge to classify the data. In addition, the proposed method is more accurate in comparison with other clustering methods based on evolutionary algorithms. DB and CS cluster validity measurements are used as the objective function. To demonstrate the superiority of the proposed method, the average of fitness function and the number of clusters determined by the proposed method is compared with three automatic clustering algorithms based on evolutionary algorithms.

Full-Text [PDF 4416 kb]   (303 Downloads)    
Type of Study: Research | Subject: Paper
Received: 2015/11/8 | Accepted: 2017/03/5 | Published: 2017/10/21 | ePublished: 2017/10/21

Add your comments about this article : Your username or Email:
Write the security code in the box

Send email to the article author

© 2015 All Rights Reserved | Signal and Data Processing

Designed & Developed by : Yektaweb