.png){kind=icon}
.png){kind=icon}
Return
NK Hybrid Genetic Algorithm for Clustering
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2018.2828643.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The NK hybrid genetic algorithm (GA) for clustering is proposed in this paper. In order to evaluate the solutions, the hybrid algorithm uses the NK clustering validation criterion 2 (NKCV2). NKCV2 uses information about the disposition of N small groups of objects. Each group is composed of K + 1 objects of the dataset. Experimental results show that density-based regions can be identified by using NKCV2 with fixed small K. In NKCV2, the relationship between decision variables is known, which in turn allows us to apply gray box optimization. Mutation operators, a partition crossover (PX), and a local search strategy are proposed, all using information about the relationship between decision variables. In PX, the evaluation function is decomposed into q independent components; PX then deterministically returns the best among 2(q) possible offspring with computational complexity O(N). The NK hybrid GA allows the detection of clusters with arbitrary shapes and the automatic estimation of the number of clusters. In the experiments, the NK hybrid GA produced very good results when compared to another GA approach and to state-of-art clustering algorithms.
Keywords:
Clustering
genetic algorithms (GAs)
NK landscapes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
View more organizations