Classic learning
type: Item
instance of: scholarly article
title: Classic learning
zbMATH Open document ID: 0869.68090
DOI: 10.1007/BF00114009
author: Michael Frazier
author: Leonard Pitt
published in: Machine Learning
publication date: 1997-03-16T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 992075
zbMATH Keywords: polynomial-time learning
zbMATH Keywords: description logics
zbMATH Keywords: terminological logics
zbMATH Keywords: CLASSIC
MaRDI profile type: Publication
cites work: Learning regular sets from queries and counterexamples
cites work: Learning conjunctions of Horn clauses
cites work: When won't membership queries help?
cites work: Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q4386959
cites work: On-line learning of rectangles and unions of rectangles
cites work: The learnability of description logics with equality constraints
cites work: A hierarchy of tractable satisfiability problems
cites work: Q3489513
cites work: Learning from a consistently ignorant teacher
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Learning in the Presence of Malicious Errors
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Inductive logic programming
cites work: A four-valued semantics for terminological logics
cites work: Prediction-preserving reducibility
cites work: Inference of finite automata using homing sequences
cites work: A theory of the learnable
full work available at URL: https://doi.org/10.1007/bf00114009
OpenAlex ID: W2997023162
description: scientific article; zbMATH DE number 992075