.png){kind=icon}
.png){kind=icon}
Return
A new grouping genetic algorithm for clustering problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.02.149.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we present a novel grouping genetic algorithm for clustering problems. Though there have been different approaches that have analyzed the performance of several genetic and evolutionary algorithms in clustering, the grouping-based approach has not been, to our knowledge, tested in this problem yet. In this paper we fully describe the grouping genetic algorithm for clustering, starting with the proposed encoding, different modifications of crossover and mutation operators, and also the description of a local search and an island model included in the algorithm, to improve the algorithm's performance in the problem. We test the proposed grouping genetic algorithm in several experiments in synthetic and real data from public repositories, and compare its results with that of classical clustering approaches, such as K-means and DBSCAN algorithms, obtaining excellent results that confirm the goodness of the proposed grouping-based methodology. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Grouping genetic algorithms
Clustering problems
Hybrid algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W