The following pages link to Queries and concept learning (Q2232294):
Displaying 50 items.
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas (Q264959) (← links)
- Learning an extension of the class of functional dependencies with queries (Q264983) (← links)
- On universal learning algorithms (Q287154) (← links)
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- On learning width two branching programs (Q293246) (← links)
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- PACS, simple-PAC and query learning (Q294709) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- On teaching sets of \(k\)-threshold functions (Q342728) (← links)
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Four one-shot learners for regular tree languages and their polynomial characterizability (Q388793) (← links)
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- On the uselessness of quantum queries (Q433109) (← links)
- Polynomial characteristic sets for \(DFA\) identification (Q442107) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries (Q503461) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Three-way concept learning based on cognitive operators: an information fusion viewpoint (Q518620) (← links)
- On learning multivalued dependencies with queries (Q533874) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- Active learning with multi-criteria decision making systems (Q736305) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Ordered term tree languages which are polynomial time inductively inferable from positive data (Q817835) (← links)
- Efficient multiple constraint acquisition (Q823769) (← links)
- Attribute-efficient learning of Boolean functions from Post closed classes (Q828191) (← links)
- Learning union of integer hypercubes with queries (with applications to monadic decomposition) (Q832265) (← links)
- Learning Boolean specifications (Q900315) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Learning a hidden graph using \(O(\log n)\)queries per edge (Q927873) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- One-shot learners using negative counterexamples and nearest positive examples (Q1029327) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
- The description identification problem (Q1190795) (← links)
