gLINC: identifying composability using group perturbation

Authors:
David J. Coffin;Christopher D. Clack
Affiliations:
University College London, Gower Street, London;University College London, Gower Street, London
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 4
Cited 2

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
On the complexity of hierarchical problem solving

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Metropolitan area network design using GA based on hierarchical linkage identification

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Lower and upper bounds for linkage discovery

IEEE Transactions on Evolutionary Computation
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of oLINC (gLINC). We show how gLINC decomposes a fitness landscape significantly faster than both LINC and oLINC.We present details of LINC, oLINC and gLINC, an empirical comparison of their speed, accuracy and sensitivity to population size on a concatenated trap function, and a discussion of their complexity and correctness.