Empirical Prediction Algorithm

Zagoruiko, Nikolay G.

Empirical Prediction Algorithm

Download BibTeX Cite

Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Planning and Problem Solving. Pages 219-221.

Abstract

The ~allowing requirements to empirical prediction algorithms are investigated: universality, non-triviality, and consistance. It is pointed out these requirements are too strong. Some variants oalgorithms in which the requirement of "consistance" is replaced by that of "the greatest simplisi ty" are tested.

Nikolay G. Zagoruiko. 1975. Empirical Prediction Algorithm. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75. IJCAI, 219–221. https://ijcai.org/proceedings/1975/33

@inproceedings{ijcai1975p33,
  title     = {Empirical Prediction Algorithm},
  author    = {Zagoruiko, Nikolay G.},
  booktitle = {Proceedings of the Fourth International Joint Conference on
               Artificial Intelligence, {IJCAI-75}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Patrick Winston and Carl Hewitt},
  pages     = {219--221},
  year      = {1975},
  note      = {Planning and Problem Solving},
  url       = {https://ijcai.org/proceedings/1975/33},
}

TY  - CPAPER
TI  - Empirical Prediction Algorithm
AU  - Zagoruiko, Nikolay G.
T2  - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1975
SP  - 219
EP  - 221
UR  - https://ijcai.org/proceedings/1975/33
ER  -