ML Anthology

Using Genetic Algorithms to Learn Disjunctive Rules from Examples

R. Andrew McCallum, Kent A. Spackman
ICML 1990 pp. 149-152
doi:10.1016/B978-1-55860-141-3.50021-3 /icml/1990/mccallum1990icml-using/

Abstract

In this paper we address the problem of learning disjunctive normal form rules from boolean-classified examples. Whereas GA's often present their solution in the form of a single individual, here we use the entire population of individuals to disjunctively represent a solution. We explain example sharing, a method of payoff sharing, and we explain over-population, a modification for increasing GA exploration.

ICML Semantic Scholar

Cite

Text

McCallum and Spackman. "Using Genetic Algorithms to Learn Disjunctive Rules from Examples." International Conference on Machine Learning, 1990. doi:10.1016/B978-1-55860-141-3.50021-3

Markdown

[McCallum and Spackman. "Using Genetic Algorithms to Learn Disjunctive Rules from Examples." International Conference on Machine Learning, 1990.](https://mlanthology.org/icml/1990/mccallum1990icml-using/) doi:10.1016/B978-1-55860-141-3.50021-3

BibTeX

@inproceedings{mccallum1990icml-using,
  title     = {{Using Genetic Algorithms to Learn Disjunctive Rules from Examples}},
  author    = {McCallum, R. Andrew and Spackman, Kent A.},
  booktitle = {International Conference on Machine Learning},
  year      = {1990},
  pages     = {149-152},
  doi       = {10.1016/B978-1-55860-141-3.50021-3},
  url       = {https://mlanthology.org/icml/1990/mccallum1990icml-using/}
}