Skip to main content
SpringerLink
Log in

New Entropy-Based Measures of Gene Significance and Epistasis

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Included in the following conference series:

Abstract

A new framework to formulate and quantify the epistasis of a problem is proposed. It is based on Shannon’s information theory. With the framework, we suggest three epistasis-related measures: gene significance, gene epistasis, and problem epistasis. The measures are believed to be helpful to investigate both the individual epistasis of a gene group and the overall epistasis that a problem has. The experimental results on various well-known problems support it.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. E. Goldberg. Simple genetic algorithms and the minimal deceptive problem. In Genetic Algorithms and Simulated Annealing, pages 74–88, 1987.

    Google Scholar 

  2. J. Horn and D.E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms 3, pages 243–270. 1995.

    Google Scholar 

  3. H. Kargupta. Signal-to-noise, crosstalk, and long range problem difficulty in genetic algorithms. In International Conference on Genetic Algorithms, pages 193–200, 1995.

    Google Scholar 

  4. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.

    Google Scholar 

  5. Y. Davidor. Epistasis variance: Suitability of a representation to genetic algorithms. Complex Systems, 4:369–383, 1990.

    Google Scholar 

  6. C.R. Reeves and C.C. Wright. An experimental design perspective on genetic algorithms. In Foundations of Genetic Algorithms 3, pages 7–22. 1995.

    Google Scholar 

  7. P. Larrañaga and J.A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.

    Google Scholar 

  8. M. Pelikan, D.E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5–20, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  9. D.I. Seo and B.R. Moon. A survey on chromosomal structures and operators for exploiting topological linkages of genes. In Genetic and Evolutionary Computation Conference, 2003.

    Google Scholar 

  10. C.E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379–423, 623–656, 1948.

    MathSciNet  MATH  Google Scholar 

  11. T. Cover and J. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.

    Google Scholar 

  12. D. Chiu, A. Wong, and B. Cheung. Information discovery through hierarchical maximum entropy discretization and synthesis. In Knowledge Discovery in Databases. MIT Press, 1991.

    Google Scholar 

  13. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms 2, pages 109–126. 1993.

    Google Scholar 

  14. S.A. Kauffman. Adaptation on rugged fitness landscapes. In D. L. Stein, editor, Lectures in the Sciences of Complexity, pages 527–618. Addison-Wesley, 1989.

    Google Scholar 

  15. B. Manderick, M. deWeger, and P. Spiessens. The genetic algorithm and the structure of the fitness landscape. In International Conference on Genetic Algorithms, pages 143–157, 1991.

    Google Scholar 

  16. P. Merz and B. Freisleben. On the effectiveness of evolutionary search in highdimensional NK-landscapes. In IEEE Conference on Evolutionary Computation, pages 741–745, 1998.

    Google Scholar 

  17. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.

    Google Scholar 

  18. T.N. Bui and B.R. Moon. A new genetic approach for the traveling salesman problem. In IEEE Conference on Evolutionary Computation, pages 7–12, 1994.

    Google Scholar 

  19. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In International Conference on Genetic Algorithms, pages 184–192, 1995.

    Google Scholar 

  20. G.A. Croes. A method for solving traveling salesman problems. Operations Research, 6:791–812, 1958.

    Article  MathSciNet  Google Scholar 

  21. TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science & Engineering, Seoul National University, Sillim-dong, Kwanak-gu, Seoul, 151-742, Korea

    Dong-Il Seo, Yong-Hyuk Kim & Byung Ro Moon

Authors
  1. Dong-Il Seo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong-Hyuk Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Byung Ro Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Scientific Computing (CASC), Lawrence Livermore National Laboratory, 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seo, DI., Kim, YH., Moon, B.R. (2003). New Entropy-Based Measures of Gene Significance and Epistasis. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation