Automatic Clustering Using Improved Imperialist Competitive Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Chaghari Arash; Feizi Derakhshi mohammad reza

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2017 | Volume:14 | Issue:2 (serial 32) Page(s): 159-169

Download Full-Text

Persian Verion

View:

1,091

Download:

Cites:

Information Journal Paper

Title

Automatic Clustering Using Improved Imperialist Competitive Algorithm

Author(s)

Chaghari Arash | Feizi Derakhshi mohammad reza | Issue Writer Certificate

Keywords

Partitional ClusteringQ1

Automatic ClusteringQ2

Imperialist Competitive Algorithm (ICA)Q2

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

Chaghari, Arash, & Feizi Derakhshi, mohammad reza. (2017). Automatic Clustering Using Improved Imperialist Competitive Algorithm. SIGNAL AND DATA PROCESSING, 14(2 (serial 32) ), 159-169. SID. https://sid.ir/paper/160755/en

Vancouver: Copy

Chaghari Arash, Feizi Derakhshi mohammad reza. Automatic Clustering Using Improved Imperialist Competitive Algorithm. SIGNAL AND DATA PROCESSING[Internet]. 2017;14(2 (serial 32) ):159-169. Available from: https://sid.ir/paper/160755/en

IEEE: Copy

Arash Chaghari, and mohammad reza Feizi Derakhshi, “Automatic Clustering Using Improved Imperialist Competitive Algorithm,” SIGNAL AND DATA PROCESSING, vol. 14, no. 2 (serial 32) , pp. 159–169, 2017, [Online]. Available: https://sid.ir/paper/160755/en

Related Journal Papers