2013
DOI: 10.1007/s11227-013-1053-1
|View full text |Cite
|
Sign up to set email alerts
|

Data clustering based on hybrid K-harmonic means and modifier imperialist competitive algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 23 publications
0
11
0
Order By: Relevance
“…In their study, CS algorithm is used with Levy flight and is found to be performing better compared to the other two methods. ICAKHM is a novel method on the basis of hybrid K-harmonic means algorithm and an improved version of the imperialist competitive algorithm (ICA) [2]. This version of ICA method uses the genetic operators of crossover and mutation to prevent the premature convergence helping KHM to evade local optima problem similar to many other evolutionary algorithms.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In their study, CS algorithm is used with Levy flight and is found to be performing better compared to the other two methods. ICAKHM is a novel method on the basis of hybrid K-harmonic means algorithm and an improved version of the imperialist competitive algorithm (ICA) [2]. This version of ICA method uses the genetic operators of crossover and mutation to prevent the premature convergence helping KHM to evade local optima problem similar to many other evolutionary algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…Step 2) The re-estimation step: the cluster centroids are recalculated from the instances assigned to the cluster according to Equation (2).…”
Section: Repeat Steps 1 Andmentioning
confidence: 99%
See 1 more Smart Citation
“…In their study, the CS algorithm is used with Levy flight and is found to be performing better compared to the other two methods. ICAKHM is a novel method on the basis of a hybrid KHM algorithm and a modified version of the imperialist competitive algorithm (ICA) [2] . This version of the ICA method uses the genetic operators of crossover and mutation to prevent the premature convergence, helping KHM to evade the local optima problem similar to many other evolutionary algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…In the simulation process, C 1 and C 2 are adjusted with different values between [1,2] ; and ω min , ω max are set with different values between [0, 1]. For instance, Table 2 shows the various assigned values for these parameters.…”
Section: Simulation Setupsmentioning
confidence: 99%