Article

Extended probe method for linkage discovery over high-cardinality alphabets

Authors:

Robert B. HeckendornAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

Pages 1484 - 1491

https://doi.org/10.1145/1276958.1277228

Published: 07 July 2007 Publication History

Abstract

The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wright's work that restricts problem representation into the binary-string domain. Discrete Fourier transform is used to analyze underlying structure in high-cardinality alphabets space. Boolean operators are replaced with new operators such as ⊕, ⊖, ⊗ and so on in high cardinality alphabets. The "probe" formulation is redesigned to determine epistatic properties of non-binary function. Theoretical analysis shows the close relationship between probe value and problem structure. A deterministic and a stochastic algorithm based on properties of probes are proposed to completely identify the linkage structure and rigourously compute all Fourier coefficients. Some discussion about linkage detection for continuous problems is given.

References

[1]

D. E. Goldberg. The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Boston, 2002.

Digital Library

[2]

D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Mtivation, analysis and first results. Complex Systems, 3:493--530.

[3]

G. R. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Ph.D. dissertation, University of Michigan, Ann Arbor, 1997.

Digital Library

[4]

R. B. Heckendorn. Embedded landscapes. Evolutionary Computation, 10(4):345--369, 2002.

Digital Library

[5]

R. B. Heckendorn and A. Wright. Efficient linkage discovery by limited probing. Evolutionary Computation, 12(4):517--545, 2004.

Digital Library

[6]

M. T. Iglesias, B. Naudts, A. Verschoren, and C. Vidal. Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets. In GECCO 2005, pages 1303--1308.

Digital Library

[7]

H. Kargupta. The gene expression messy genetic algorithm. In Proc. of the IEEE international conference on Evolutionary Computation. Nogoya, Japan, 1996.

[8]

H. Kargupta and B. Park. Gene expression and fast construction of distributed evolutionary representation. Evolutionary computation, 9(1):43--59, 2001.

Digital Library

[9]

G. J. Koehler, S. Bhattacharyya, and M. D. Vose. General cardinality genetic algorithms. Evolutionary Computation, 5(4):439--549, 1998.

Digital Library

[10]

P. Larranaga and J. A. Lozano. Estimation of Distribution Algorithms: A new Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston, 2002.

Digital Library

[11]

H. Muhlenbein and R. Hons. The estimation of distribution and the minimum relative entropy principle. Evolutionary Computation, 13(1):1--27, 2005.

Digital Library

[12]

M. Munetomo and D. E. Goldberg. Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation, 7(4):377--398, 1999.

Digital Library

[13]

C. K. Oei. Walsh Function Analysis of Genetic Algorithms of Nonbinary Strings. Unpublished masters thesis, UIUC, 1992.

[14]

M. Pelikan. Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary algorithms. Springer Publication, Berlin, 2005.

[15]

M. Tezuka, M. Munetomo, and K. Akama. Linkage identification by nonlinearity check for real-coded genetic algorithms. In GECCO 2004 Proceedings, Part 2, Lecture Notes in Computer Science, pages 222--233, 2004.

[16]

D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331--352, 1999.

Digital Library

[17]

S. Zhou, R. B. Heckendorn, and Z. Sun. Detecting the epistatic structure of generalized embedded landscape. Genetic Programming and Evolvable Machines, submitted.

Digital Library

[18]

S. Zhou and Z. Sun. Matrix interpretation of generalized embedded landscapes. In GECCO 2007 proceedings.

Digital Library

Cited By

Chen YChuang CHuang Y(2012)Inductive linkage identification on building blocks of different sizes and typesInternational Journal of Systems Science10.1080/00207721.2011.56663943:12(2202-2213)Online publication date: Dec-2012
https://doi.org/10.1080/00207721.2011.566639
Santana RLarrañaga PLozano J(2008)Research topics in discrete estimation of distribution algorithms based on factorizationsMemetic Computing10.1007/s12293-008-0002-71:1(35-54)Online publication date: 12-Dec-2008
https://doi.org/10.1007/s12293-008-0002-7
Zhou SSun ZLipson H(2007)Matrix interpretation of generalized embedded landscapeProceedings of the 9th annual conference on Genetic and evolutionary computation10.1145/1276958.1277269(1540-1542)Online publication date: 7-Jul-2007
https://dl.acm.org/doi/10.1145/1276958.1277269

Index Terms

Extended probe method for linkage discovery over high-cardinality alphabets
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Detecting the epistatic structure of generalized embedded landscape

Working under the premise that most optimizable functions are of bounded epistasis, this paper addresses the problem of discovering the linkage structure of a black-box function with a domain of arbitrary-cardinality under the assumption of bounded ...
Discrete Generalized Fresnel Functions and Transforms in an Arbitrary Discrete Basis

The idea of generalized Fresnel functions, which traces back to expressing a discrete transform as a linear convolution, is developed in this paper. The generalized discrete Fresnel functions and the generalized discrete Fresnel transforms for an ...
Comments on “Generalised finite Radon transform for N × N images”

In Kingston and Svalbe [1], a generalized finite Radon transform (FRT) that applied to square arrays of arbitrary size NxN was defined and the Fourier slice theorem was established for the FRT. Kingston and Svalbe asserted that ''the original definition ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

July 2007

2313 pages

ISBN:9781595936974

DOI:10.1145/1276958

General Chair:
Hod Lipson
Cornell University, USA

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, England

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
118
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen YChuang CHuang Y(2012)Inductive linkage identification on building blocks of different sizes and typesInternational Journal of Systems Science10.1080/00207721.2011.56663943:12(2202-2213)Online publication date: Dec-2012
https://doi.org/10.1080/00207721.2011.566639
Santana RLarrañaga PLozano J(2008)Research topics in discrete estimation of distribution algorithms based on factorizationsMemetic Computing10.1007/s12293-008-0002-71:1(35-54)Online publication date: 12-Dec-2008
https://doi.org/10.1007/s12293-008-0002-7
Zhou SSun ZLipson H(2007)Matrix interpretation of generalized embedded landscapeProceedings of the 9th annual conference on Genetic and evolutionary computation10.1145/1276958.1277269(1540-1542)Online publication date: 7-Jul-2007
https://dl.acm.org/doi/10.1145/1276958.1277269

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents