A new grouping genetic algorithm for clustering problems

详细信息    查看全文

• 作者：L.E. Agustı ; ´ ; n-Blas^a ; S. Salcedo-Sanz^a ; ^{sancho.salcedo@uah.es} ; S. Jimé ; nez-Ferná ; ndez^a ; L. Carro-Calvo^a ; J. Del Ser^b ; J.A. Portilla-Figueras^a
• 关键词：Grouping genetic algorithms ; Clustering problems ; Hybrid algorithms
• 刊名：Expert Systems with Applications
• 出版年：2012
• 出版时间：August, 2012
• 年：2012
• 卷：39
• 期：10
• 页码：9695-9703
• 全文大小：533 K

文摘

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.