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