Queries and concept learning
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Separating models of learning with faulty teachers
- One-shot learners using negative counterexamples and nearest positive examples
- Necessary and sufficient conditions for learning with correction queries
- Learning regular sets from queries and counterexamples
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Equivalence of models for polynomial learnability
- Efficient learning of context-free grammars from positive structural examples
- The description identification problem
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Learning semilinear sets from examples and via queries
- Structure identification in relational data
- IIPS: A framework for specifying inductive-inference problems
- Learning with unreliable boundary queries
- Attribute-efficient learning in query and mistake-bound models
- An introduction to some statistical aspects of PAC learning theory
- Learning from examples and membership queries with structured determinations
- Noise-tolerant parallel learning of geometric concepts
- On the cut-off point for combinatorial group testing
- Extremes in the degrees of inferability
- Nonuniform learnability
- Halfspace learning, linear programming, and nonmalicious distributions
- Locating P/poly optimally in the extended low hierarchy
- Efficient learning with equivalence queries of conjunctions of modulo functions
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- A model of interactive teaching
- A sufficient condition for polynomial distribution-dependent learnability
- Exact learning of linear combinations of monotone terms from function value queries
- Conjunctions of unate DNF formulas: Learning and structure
- Error-free and best-fit extensions of partially defined Boolean functions
- Efficient learning with virtual threshold gates
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Learning counting functions with queries
- Recent advances of grammatical inference
- Learning unions of tree patterns using queries
- Learning nested differences in the presence of malicious noise
- Learning orthogonal F-Horn formulas
- A simple algorithm for learning O(log n)-term DNF
- Learning from examples with unspecified attribute values.
- The monotone theory for the PAC-model.
- Queries revisited.
- Learnability of quantified formulas.
- On learning multicategory classification with sample queries.
- Structural results about exact learning with unspecified attribute values
- Sample complexity of model-based search
- Improved bounds about on-line learning of smooth-functions of a single variable
- The learnability of exclusive-or expansions based on monotone DNF formulas
- Exact learning via teaching assistants
- A new abstract combinatorial dimension for exact learning via queries
- Adaptive and self-confident on-line learning algorithms
- Logical analysis of binary data with missing bits
- Inferring regular languages and \(\omega\)-languages
- A theory of formal synthesis via inductive learning
- Nonadaptive quantum query complexity
- Interactive graph-matching using active query strategies
- Exact learning of multivalued dependency formulas
- Non-adaptive learning of a hidden hypergraph
- Characterizing concept drift
- Exploring learnability between exact and PAC
- The learnability of unions of two rectangles in the two-dimensional discretized space
- A general lower bound on the number of examples needed for learning
- Scaling, machine learning, and genetic neural nets
- General lower bounds on the query complexity within the exact learning model
- A subexponential exact learning algorithm for DNF using equivalence queries
- The consistency dimension and distribution-dependent learning from queries.
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Apple tasting.
- On-line learning with linear loss constraints.
- Improved lower bounds for learning from noisy examples: An information-theoretic approach
- The query complexity of finding local minima in the lattice
- Uniform characterizations of polynomial-query learnabilities
- Learning elementary formal systems with queries.
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- On learning monotone DNF under product distributions
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- On specifying Boolean functions by labelled examples
- An approach to guided learning of Boolean functions
- Asking questions to minimize errors
- The bounded injury priority method and the learnability of unions of rectangles
- Learning parities in the mistake-bound model
- Negative results on learning multivalued dependencies with queries
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- Bidual Horn functions and extensions
- Identification of partial disjunction, parity, and threshold functions
- A method based on multi-standard active learning to recognize entities in electronic medical record
- Active learning of timed automata with unobservable resets
- Automatic learning from positive data and negative counterexamples
- Active-learning a convex body in low dimensions
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning algorithms
- Quantum learning of concentrated Boolean functions
- Approximate computation of exact association rules
- Learning of bounded-weight Boolean functions
- Learning under \(p\)-tampering poisoning attacks
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Optimizations in computing the Duquenne-Guigues basis of implications
- Probably approximately correct learning of Horn envelopes from queries
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- The power of random counterexamples
- Three-way cognitive concept learning via multi-granularity
This page was built for publication: Queries and concept learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232294)
