出版社:The Japanese Society for Evolutionary Computation
摘要:In this paper, we propose a novel evolutionary algorithm for solving problems such that individuals are represented by graphs. In order to address the difficulty of genotype-phenotype mappings of individuals, we incorporate a notion of Graph Kernels into Estimation of Distribution Algorithms. That is, the proximity of individuals in the proposed method is defined not on genotype space but on feature space. We show the effectiveness of the proposed method on several experiments on Edge-Max, Edge-Min, and graph isomorphic problems.
关键词:estimation of distribution algorithms;graph kernels;kernel density estimation