scientific article
From MaRDI portal
Publication:4040311
zbMath0722.68091MaRDI QIDQ4040311
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items
Hypothesis finding based on upward refinement of residue hypotheses., Learning Boolean concepts in the presence of many irrelevant features, Can PAC learning algorithms tolerate random attribute noise?, Learning fallible deterministic finite automata, Schema induction for logic program synthesis, 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, Four types of noise in data for PAC learning, The description identification problem, Learning concepts and their unions from positive data with refinement operators, PAC-learning in the presence of one-sided classification~noise, Algorithms for learning regular expressions from positive data, On the connections between statistical disclosure control for microdata and some artificial intelligence tools, 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, Exact Learning of Discretized Geometric Concepts, Unnamed Item, Improved lower bounds for learning from noisy examples: An information-theoretic approach
