ML Anthology

Learning to Predict Non-Deterministically Generated Strings

Moshe Koppel
MLJ 1991 pp. 85-99
doi:10.1007/BF00058927 /mlj/1991/koppel1991mlj-learning/

Abstract

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.

PDF MLJ Semantic Scholar

Cite

Text

Koppel. "Learning to Predict Non-Deterministically Generated Strings." Machine Learning, 1991. doi:10.1007/BF00058927

Markdown

[Koppel. "Learning to Predict Non-Deterministically Generated Strings." Machine Learning, 1991.](https://mlanthology.org/mlj/1991/koppel1991mlj-learning/) doi:10.1007/BF00058927

BibTeX

@article{koppel1991mlj-learning,
  title     = {{Learning to Predict Non-Deterministically Generated Strings}},
  author    = {Koppel, Moshe},
  journal   = {Machine Learning},
  year      = {1991},
  pages     = {85-99},
  doi       = {10.1007/BF00058927},
  volume    = {7},
  url       = {https://mlanthology.org/mlj/1991/koppel1991mlj-learning/}
}