Linkage identification based on epistasis measures to realize efficient genetic algorithms

Authors:
M. Munetomo
Affiliations:
Center for Inf. & Multimedia Studies, Hokkaido Univ., Sapporo, Japan
Venue:
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Year:
2002

Citing 0
Cited 9

Efficient Linkage Discovery by Limited Probing

Evolutionary Computation
Convergence Time for the Linkage Learning Genetic Algorithm

Evolutionary Computation
Linkage identification by fitness difference clustering

Evolutionary Computation
Empirical investigations on parallel competent genetic algorithms

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A parallel genetic algorithm based on linkage identification

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Research frontier: linkage discovery through data mining

IEEE Computational Intelligence Magazine
The essence of real-valued characteristic function for pairwise relation in linkage learning for EDAs

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Parameter-less local optimizer with linkage identification for deterministic order-k decomposable problems

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Interaction detection for hybrid decomposable problems

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Genetic algorithms (GAs) process building blocks (BBs) mixed and tested through genetic recombination operators. To realize effective BB processing, linkage identification, which detects a set of tightly linked loci, is essential. This paper proposes linkage identification with epistasis measures (LIEM), which detects linkage groups based on a pair-wise epistasis measure.