Empirical Prediction Algorithm
Abstract
The following requirements to empirical prediction algorithms are investigated: universality, non-triviality, and consistence. It is pointed out these requirements are too strong. Some variants of algorithms in which requirement of consistance is replaced by that of the greatest simplisity are tested.
Cite
Text
Zagoruiko. "Empirical Prediction Algorithm." International Joint Conference on Artificial Intelligence, 1975.Markdown
[Zagoruiko. "Empirical Prediction Algorithm." International Joint Conference on Artificial Intelligence, 1975.](https://mlanthology.org/ijcai/1975/zagoruiko1975ijcai-empirical/)BibTeX
@inproceedings{zagoruiko1975ijcai-empirical,
title = {{Empirical Prediction Algorithm}},
author = {Zagoruiko, Nikolay G.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1975},
pages = {219-222},
url = {https://mlanthology.org/ijcai/1975/zagoruiko1975ijcai-empirical/}
}