New entropy-based measures of gene significance and epistasis

Authors:
Dong-Il Seo;Yong-Hyuk Kim;Byung-Ro Moon
Affiliations:
School of Computer Science & Engineering, Seoul National University, Seoul, Korea;School of Computer Science & Engineering, Seoul National University, Seoul, Korea;School of Computer Science & Engineering, Seoul National University, Seoul, Korea
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 9
Cited 8

Elements of information theory

Elements of information theory
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Signal-to-noise, Crosstalk, and Long Range Problem Difficulty in Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Epistasis in Genetic Algorithms: An Experimental Design Perspective

Proceedings of the 6th International Conference on Genetic Algorithms
A survey on chromosomal structures and operators for exploiting topological linkages of genes

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

Computing the epistasis variance of large-scale traveling salesman problems

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Phase transition in a random NK landscape model

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
An Information-Theoretic Analysis on the Interactions of Variables in Combinatorial Optimization Problems

Evolutionary Computation
Phase transition in a random NK landscape model

Artificial Intelligence
Direct and explicit building blocks identification and composition algorithm

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A survey on chromosomal structures and operators for exploiting topological linkages of genes

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Amount and type of information: a GA-hardness taxonomy

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

Quantified Score

Hi-index	0.00

Visualization

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.