Linkage identification by non-monotonicity detection for overlapping functions

Authors:
Masaharu Munetomo;David E. Goldberg
Affiliations:
Graduate School of Engineering Hokkaido University North 13, West 8, Kita-ku, Sapporo 060-8628, Japan munetomo@eng.hokudai.ac.jp;Illinois Genetic Algorithms Laboratory University of Illinois at Urbana-Champaign 104 South Mathews Avenue Urbana, IL 61801, USA deg@uiuc.edu
Venue:
Evolutionary Computation
Year:
1999

Citing 4
Cited 24

Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms

Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Mixing in Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The equation for response to selection and its use for prediction

Evolutionary Computation

On Appropriate Adaptation Levels for the Learning of Gene Linkage

Genetic Programming and Evolvable Machines
Getting the best of both worlds: discrete and continuous genetic and evolutionary algorithms in concert

Information Sciences: an International Journal - Special issue: Evolutionary computation
Sub-structural niching in estimation of distribution algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Computing the epistasis variance of large-scale traveling salesman problems

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Gene Expression and Fast Construction of Distributed Evolutionary Representation

Evolutionary Computation
Efficient Linkage Discovery by Limited Probing

Evolutionary Computation
Multi-objective test problems, linkages, and evolutionary methodologies

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Linkage identification by fitness difference clustering

Evolutionary Computation
An Information-Theoretic Analysis on the Interactions of Variables in Combinatorial Optimization Problems

Evolutionary Computation
Extended probe method for linkage discovery over high-cardinality alphabets

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Detecting the epistatic structure of generalized embedded landscape

Genetic Programming and Evolvable Machines
Tightness time for the linkage learning genetic algorithm

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Efficient linkage discovery by limited probing

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
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
A selecto-recombinative genetic algorithm with continuous chromosome reconfiguration

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Chi-Square matrix: an approach for building-block identification

ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Sub-structural niching in non-stationary environments

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
A surrogate-assisted and informed linkage aware GA

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Efficient model building in competent genetic algorithms using DSM clustering

AI Communications
Associated and assorted recombination in SBX operator for problems with linkages

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
A block-based evolutionary algorithm for flow-shop scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the linkage identification by non-monotonicity detection (LIMD) procedure and its extension for overlapping functions by introducing the tightness detection (TD) procedure. The LIMD identifies linkage groups directly by performing order-2 simultaneous perturbations on a pair of loci to detect monotonicity/non-monotonicity of fitness changes. The LIMD can identify linkage groups with at most order of k when it is applied to O(2k) strings. The TD procedure calculates tightness of linkage between a pair of loci based on the linkage groups obtained by the LIMD. By removing loci with weak tightness from linkage groups, correct linkage groups are obtained for overlapping functions, which were considered difficult for linkage identification procedures.