Learning from Queries and Examples with Tree-structured Bias
Lists
Only you see this
Abstract
Incorporating declarative bias or prior knowledge into learning is an active research topic in machine learning. Tree-structured bias specifies the prior knowledge as a tree of “relevance” relationships between attributes. This paper presents a learning algorithm that implements tree-structured bias, i.e., learns any target function probably approximately correctly from random examples and membership queries if it obeys a given tree-structured bias. The theoretical predictions of the paper are empirically validated.
BibTeX
@inproceedings{tadepalli1993learning,
author = {Prasad Tadepalli},
title = {{Learning from Queries and Examples with Tree-structured Bias}},
booktitle = {International Conference on Machine Learning},
year = {1993},
doi = {10.1016/b978-1-55860-307-3.50048-4},
}Loading related content...