A probabilistic database approach to the analysis of genetic algorithms

Anil Menon, Kishan Mehrotra, Chilukuri K Mohan, Sanjay Ranka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper takes a fresh look at some of the key ideas of genetic algorithms, using concepts drawn from the theory of majorization and probabilistic databases. We show the intimate relationships between GAs and the theory of probabilistic databases. We show how deception is well described using Saari's theorem, and its relationships with the Simpson and other paradoxes in decision theory. Reconstructability, a concept of fundamental importance in databases, is proposed as a useful substitute for deception. The database projection operator is connected with hyperplane partitions, and is used to show the nexus between point crossover operators and the join operator. Using results from probabilistic databases, we show that crossover may be considered as a majorization operator.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages164-173
Number of pages10
Volume1141
ISBN (Print)354061723X, 9783540617235
DOIs
StatePublished - 1996
EventInternational Conference on Evolutionary Computation - 4th International Conference on Parallel Problem Solving from Nature, PPSN 1996 - Berlin, Germany
Duration: Sep 22 1996Sep 26 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1141
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Evolutionary Computation - 4th International Conference on Parallel Problem Solving from Nature, PPSN 1996
CountryGermany
CityBerlin
Period9/22/969/26/96

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'A probabilistic database approach to the analysis of genetic algorithms'. Together they form a unique fingerprint.

  • Cite this

    Menon, A., Mehrotra, K., Mohan, C. K., & Ranka, S. (1996). A probabilistic database approach to the analysis of genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1141, pp. 164-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1141). Springer Verlag. https://doi.org/10.1007/3-540-61723-X_980