scientific article; zbMATH DE number 193511
From MaRDI portal
Publication:4040311
zbMATH Open0722.68091MaRDI QIDQ4040311FDOQ4040311
Authors: Philip D. Laird 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
identification problemrefinement relationsmathematical model of learningprobably approximately correct identification
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Cited In (31)
- Learning fallible deterministic finite automata
- Costs of general purpose learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- Learning in parallel
- 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)
