Oblivious PAC learning of concept hierarchies

Authors:
Michael J. Kearns
Affiliations:
AT & T Bell Laboratories, Murray Hill, New Jersey
Venue:
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Year:
1992

Citing 8
Cited 0

A theory of the learnable

Communications of the ACM
On learning Boolean functions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
Learning integer lattices

COLT '90 Proceedings of the third annual workshop on Computational learning theory
Equivalence of models for polynomial learnability

Information and Computation
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Learning From Noisy Examples

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce an extension of the Probably Approximately Correct (PAC) learning model to study the problem of learning inclusion hierarchies of concepts (sometimes called is-a hierarchies) from random examples. Using only the hypothesis representations output over many different runs of a learning algorithm, we wish to reconstruct the partial order (with respect to generality) among the different target concepts used to train the algorithm. We give an efficient algorithm for this problem with the property that each run is oblivious of all other runs: each run can take place in isolation, without access to any examples except those of the current target concept, and without access to the current pool of hypothesis representations. Thus, additional mechanisms providing shared information between runs are not necessary for the inference of some nontrivial hierarchies.