Classic learning
From MaRDI portal
Publication:676240
DOI10.1007/BF00114009zbMath0869.68090OpenAlexW2997023162MaRDI QIDQ676240
Publication date: 16 March 1997
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00114009
Related Items
Learning elementary formal systems with queries., Computing the least common subsumer w.r.t. a background terminology, Matching in Hybrid Terminologies, Construction and learnability of canonical Horn formulas, Learning unions of tree patterns using queries, Learning logic programs with structured background knowledge, Unnamed Item, Learning conditional preference networks, Pac-learning non-recursive Prolog clauses, Pac-learning non-recursive Prolog clauses, Structural subsumption and least common subsumers in a description logic with existential and number restrictions
Cites Work
- Unnamed Item
- Unnamed Item
- Prediction-preserving reducibility
- Learning regular sets from queries and counterexamples
- A four-valued semantics for terminological logics
- Learning conjunctions of Horn clauses
- A hierarchy of tractable satisfiability problems
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- The learnability of description logics with equality constraints
- On-line learning of rectangles and unions of rectangles
- When won't membership queries help?
- Learning from a consistently ignorant teacher
- Inference of finite automata using homing sequences
- Learning in the Presence of Malicious Errors
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Cryptographic limitations on learning Boolean formulae and finite automata
- Probability Inequalities for Sums of Bounded Random Variables
- Inductive logic programming
