2011
DOI: 10.1007/s12046-011-0026-4
|View full text |Cite
|
Sign up to set email alerts
|

A new hybrid imperialist competitive algorithm on data clustering

Abstract: Clustering is a process for partitioning datasets. This technique is very useful for optimum solution. k-means is one of the simplest and the most famous methods that is based on square error criterion. This algorithm depends on initial states and converges to local optima. Some recent researches show that k-means algorithm has been successfully applied to combinatorial optimization problems for clustering. In this paper, we purpose a novel algorithm that is based on combining two algorithms of clustering; k-m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…3. An extended ICA Since ICA is still in its infancy and intensive studies are needed to improve its performance, many novel operators are proposed [36,41,49]. In order to improve the performance of ICA and obtain better solution quality, in this paper, two steps of basic ICA, including assimilation and revolution, are modi ed.…”
Section: -Step 1: Generating Initial Empiresmentioning
confidence: 99%
See 1 more Smart Citation
“…3. An extended ICA Since ICA is still in its infancy and intensive studies are needed to improve its performance, many novel operators are proposed [36,41,49]. In order to improve the performance of ICA and obtain better solution quality, in this paper, two steps of basic ICA, including assimilation and revolution, are modi ed.…”
Section: -Step 1: Generating Initial Empiresmentioning
confidence: 99%
“…The Imperialist Competitive Algorithm (ICA), introduced by Atashpaz and Lucas [33] and Atashpaz et al [34], is an evolutionary algorithm based on human's socio-political evolution. This evolutionary optimization algorithm has an appropriate performance in many optimization problems such as inventory control [35], data clustering [36], scheduling [37], reliability [38], game theory [39], supply chain [40], project scheduling [41], dynamic facility layout [42], Euclidean minimal spanning tree [43], global optimization [44], and so on. Recently, Hosseini and Al Khaled [45] have reviewed the underlying ideas of how ICA and its application to the engineering disciplines mainly in industrial engineering have emerged.…”
Section: Introductionmentioning
confidence: 99%
“…First, the colonies in each of the empires start moving toward their relevant imperialist state and change the place in new position. [22] Each empire that couldn't be success in competition would be eliminated and is considered as a colony in competition to be assimilated by other imperialist. Remaining of one emperor is the stopping point of the algorithm.…”
Section: Imperialist Competitive Algorithmmentioning
confidence: 99%
“…Fuzzy C-means clustering algorithm is an iterative algorithm for clustering the data (Niknam, Taherian Fard, Ehrampoosh, & Rousta, 2011;Wang, 1997). The objective of the algorithm is to determine the centres of the clusters and the membership degree of each data to each cluster, to minimize the following function:…”
Section: Fuzzy C-means Clustering Algorithmmentioning
confidence: 99%