2021
DOI: 10.1016/j.patcog.2021.107849
|View full text |Cite
|
Sign up to set email alerts
|

Memetic differential evolution methods for clustering problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(9 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…In the work of [58,8,34,35], DC (Difference of Convex functions) programming is used to define efficient heuristic algorithms for clustering large datasets. The algorithm k-means has also been used as a local search subroutine in different algorithms, as in the population-based metaheuristic developed in [27] and in the differential evolution scheme proposed in [44].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the work of [58,8,34,35], DC (Difference of Convex functions) programming is used to define efficient heuristic algorithms for clustering large datasets. The algorithm k-means has also been used as a local search subroutine in different algorithms, as in the population-based metaheuristic developed in [27] and in the differential evolution scheme proposed in [44].…”
Section: Literature Reviewmentioning
confidence: 99%
“…To overcome the low search ability and premature convergence of quantum inspired differential evolution (QDE), an enhanced MSIQDE algorithm was proposed in [65]. For solving Minimum Sum-of-Squares Clustering problem, Memetic Differential Evolution (MDE) was employed in [66]. The authors offered four algorithm variants that differ on the matching approach.…”
Section: Implementation Of Optimization Algorithm: Differential Evolutionmentioning
confidence: 99%
“…Jain and Dharavath have proposed memetic salp swarm algorithm for feature extraction in crop disease detection system 30 . Mansueto and Schoen have presented a new implementation of the memetic differential evolution (MDE) algorithm based on the development of k‐means for the Euclidean minimum sum‐of‐squares clustering clustering problem 31 . Similarly, Mustafa et al have used MDE to solve text clustering problems 32 …”
Section: Introductionmentioning
confidence: 99%
“…30 Mansueto and Schoen have presented a new implementation of the memetic differential evolution (MDE) algorithm based on the development of k-means for the Euclidean minimum sum-of-squares clustering clustering problem. 31 Similarly, Mustafa et al have used MDE to solve text clustering problems. 32 Like memetic algorithms, another approach inspired by GA is the elite evolution strategy (ES).…”
Section: Introductionmentioning
confidence: 99%