Learning from examples with unspecified attribute values.
From MaRDI portal
Publication:1401919
DOI10.1016/S0890-5401(02)00030-5zbMath1054.68112MaRDI QIDQ1401919
Stephen D. Scott, Sally A. Goldman, Stephen S. Kwek
Publication date: 19 August 2003
Published in: Information and Computation (Search for Journal in Brave)
Decision treesDNF formulasExact learningEquivalence queriesMembership queriesUnspecified or missing attributes
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
A general dimension for query learning ⋮ Learning from examples with unspecified attribute values. ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ DL-FOIL Concept Learning in Description Logics ⋮ Learning definite Horn formulas from closure queries ⋮ Partial observability and learnability ⋮ General lower bounds on the query complexity within the exact learning model ⋮ Logical analysis of binary data with missing bits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- Learning with restricted focus of attention
- Efficient distribution-free learning of probabilistic concepts
- On restricted-focus-of-attention learnability of Boolean functions
- Learning from examples with unspecified attribute values.
- Structural results about exact learning with unspecified attribute values
- Oracles and queries that are sufficient for exact learning
- Learning to reason with a restricted view
- Queries and concept learning
- Exact learning Boolean functions via the monotone theory
- Read-twice DNF formulas are properly learnable
- A theory of the learnable
- Learning read-once formulas with queries
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
