Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions
Abstract
Supervised learning algorithms make several simplifying assumptions concerning the characteristics of the concept descriptions to be learned. For example, concepts are often assumed to (1) be defined with respect to the same set of relevant attributes, (2) be disjoint in instance space, and (3) have uniform instance distributions. While these assumptions constrain the learning task, they unfortunately limit an algorithm's applicability. We describe a supervised, incremental, instance-based learning algorithm (Bloom) that removes these assumptions. Bloom learns relative attribute relevancies independently for each concept, allows instances to be members of any subset of concepts, and represents graded concept descriptions.
Cite
Text
Aha. "Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions." International Conference on Machine Learning, 1989. doi:10.1016/B978-1-55860-036-2.50098-9Markdown
[Aha. "Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions." International Conference on Machine Learning, 1989.](https://mlanthology.org/icml/1989/aha1989icml-incremental/) doi:10.1016/B978-1-55860-036-2.50098-9BibTeX
@inproceedings{aha1989icml-incremental,
title = {{Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions}},
author = {Aha, David W.},
booktitle = {International Conference on Machine Learning},
year = {1989},
pages = {387-391},
doi = {10.1016/B978-1-55860-036-2.50098-9},
url = {https://mlanthology.org/icml/1989/aha1989icml-incremental/}
}