Average Case Analysis of Conjunctive Learning Algorithms
Abstract
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the number of training examples. We apply this framework to a purely empirical learning algorithm, (the one-sided algorithm for pure conjunctive concepts), and to an algorithm that combines empirical and explanation-based learning. We evaluate the average-case models by comparing the accuracy predicted by the models to the actual accuracy obtained by running the learning algorithms.
Cite
Text
Pazzani and Sarrett. "Average Case Analysis of Conjunctive Learning Algorithms." International Conference on Machine Learning, 1990. doi:10.1016/B978-1-55860-141-3.50044-4Markdown
[Pazzani and Sarrett. "Average Case Analysis of Conjunctive Learning Algorithms." International Conference on Machine Learning, 1990.](https://mlanthology.org/icml/1990/pazzani1990icml-average/) doi:10.1016/B978-1-55860-141-3.50044-4BibTeX
@inproceedings{pazzani1990icml-average,
title = {{Average Case Analysis of Conjunctive Learning Algorithms}},
author = {Pazzani, Michael J. and Sarrett, Wendy},
booktitle = {International Conference on Machine Learning},
year = {1990},
pages = {339-347},
doi = {10.1016/B978-1-55860-141-3.50044-4},
url = {https://mlanthology.org/icml/1990/pazzani1990icml-average/}
}