Learning with Genetic Algorithms: An Overview
Abstract
Genetic algorithms represent a class of adaptive search techniques that have been intensively studied in recent years. Much of the interest in genetic algorithms is due to the fact that they provide a set of efficient domain-independent search heuristics which are a significant improvement over traditional “weak methods” without the need for incorporating highly domain-specific knowledge. There is now considerable evidence that genetic algorithms are useful for global function optimization and NP-hard problems. Recently, there has been a good deal of interest in using genetic algorithms for machine learning problems. This paper provides a brief overview of how one might use genetic algorithms as a key element in learning systems.
Cite
Text
De Jong. "Learning with Genetic Algorithms: An Overview." Machine Learning, 1988. doi:10.1007/BF00113894Markdown
[De Jong. "Learning with Genetic Algorithms: An Overview." Machine Learning, 1988.](https://mlanthology.org/mlj/1988/jong1988mlj-learning/) doi:10.1007/BF00113894BibTeX
@article{jong1988mlj-learning,
title = {{Learning with Genetic Algorithms: An Overview}},
author = {De Jong, Kenneth A.},
journal = {Machine Learning},
year = {1988},
pages = {121-138},
doi = {10.1007/BF00113894},
volume = {3},
url = {https://mlanthology.org/mlj/1988/jong1988mlj-learning/}
}