An Analysis of Generalization as a Search Problem
Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .
Abstract
The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ. Several classes of search strategies are then analyzed and compared in terms of their relative capabilities and computational complexities.
Tom M. Mitchell. 1979. An Analysis of Generalization as a Search Problem. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79. IJCAI, https://ijcai.org/proceedings/1979/126
Mitchell, T. M. (1979). An Analysis of Generalization as a Search Problem. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79. IJCAI. https://ijcai.org/proceedings/1979/126
@inproceedings{ijcai1979p126,
title = {An Analysis of Generalization as a Search Problem},
author = {Mitchell, Tom M.},
booktitle = {Proceedings of the Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-79}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Bruce G. Buchanan},
year = {1979},
month = {8},
url = {https://ijcai.org/proceedings/1979/126},
}
TY - CPAPER TI - An Analysis of Generalization as a Search Problem AU - Mitchell, Tom M. T2 - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79 PB - International Joint Conferences on Artificial Intelligence PY - 1979 UR - https://ijcai.org/proceedings/1979/126 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
