scientific article; zbMATH DE number 193511

MaRDI QIDQ4040311zbMATH OpenFDO

Authors Philip D. Laird

Publication date 5 June 1993

zbMATH Keywords

identification problemrefinement relationsmathematical model of learningprobably approximately correct identification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Recommendations

• Learning regular sets from queries and counterexamples
• The description identification problem
• scientific article; zbMATH DE number 1373681
• scientific article; zbMATH DE number 2080445
• Learning and classifying

Cited in

(31)

• Learning fallible deterministic finite automata
• scientific article; zbMATH DE number 2080445 (Why is no real title available?)
• Costs of general purpose learning
• scientific article; zbMATH DE number 1875403 (Why is no real title available?)
• Noise modelling and evaluating learning from examples
• On the role of search for learning from examples
• Can PAC learning algorithms tolerate random attribute noise?
• PAC-learning a decision tree with pruning
• On approximately identifying concept classes in the limit
• Algorithms for learning regular expressions from positive data
• Learning from Multiple Sources of Inaccurate Data
• Schema induction for logic program synthesis
• Learning with restricted focus of attention
• Learning with unreliable boundary queries
• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• Specification and simulation of statistical query algorithms for efficiency and noise tolerance
• Hypothesis finding based on upward refinement of residue hypotheses.
• Learning Boolean concepts in the presence of many irrelevant features
• Learning Boolean functions in AC^0on attribute and classification noise -- estimating an upper bound on attribute and classification noise
• Learning in parallel
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• An approach to one-bit compressed sensing based on probably approximately correct learning theory
• On the connections between statistical disclosure control for microdata and some artificial intelligence tools
• The description identification problem
• Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
• Improved lower bounds for learning from noisy examples: An information-theoretic approach
• Learning concepts and their unions from positive data with refinement operators
• PAC-learning in the presence of one-sided classification~noise
• Some deterministic models of concept identification
• Exact Learning of Discretized Geometric Concepts
• Four types of noise in data for PAC learning

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 Q4040311)