scientific article; zbMATH DE number 67621
From MaRDI portal
Publication:4013540
zbMATH Open0747.68043MaRDI QIDQ4013540FDOQ4013540
Authors: Mark B. Pleszkoch, William Gasarch 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
- Learning via queries and oracles
- Learning via queries
- Oracles and queries that are sufficient for exact learning
- scientific article; zbMATH DE number 177810
- Learning via queries in [+, <]
- Learning via finitely many queries
- scientific article; zbMATH DE number 67809
- Learnability of solutions to conjunctive queries
- Queries and concept learning
- Learning implications from data and from queries
Cited In (15)
- The complexity of universal text-learners.
- Title not available (Why is that?)
- Equivalences between learning of data and probability distributions, and their applications
- Learning languages from positive data and a finite number of queries
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Learning languages from positive data and negative counterexamples
- Learning algebraic structures from text
- Learning by switching type of information.
- Learning via queries and oracles
- Vacillatory and BC learning on noisy data
- Robust learning with infinite additional information
- The complexity of universal text-learners
- Extremes in the degrees of inferability
- How many queries are needed to learn?
- On the non-existence of maximal inference degrees for language identification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013540)
