Learning from examples with unspecified attribute values.

DOI10.1016/S0890-5401(02)00030-5MaRDI QIDQ1401919zbMATH OpenFDO

Authors Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott

Publication date 19 August 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0890-5401(02)00030-5

zbMATH Keywords

Decision treesDNF formulasEquivalence queriesExact learningMembership queriesUnspecified or missing attributes

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Structural results about exact learning with unspecified attribute values
• scientific article; zbMATH DE number 2086401
• How many missing answers can be tolerated by query learners?
• Partial observability and learnability
• Inductive learning models with missing values

Cites work

• A characterization and nearly linear-time equivalence test for -branching programs
• A theory of the learnable
• Efficient distribution-free learning of probabilistic concepts
• Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
• Exact learning Boolean functions via the monotone theory
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3978379 (Why is no real title available?)
• scientific article; zbMATH DE number 67616 (Why is no real title available?)
• scientific article; zbMATH DE number 3594626 (Why is no real title available?)
• Learning from examples with unspecified attribute values.
• Learning read-once formulas with queries
• Learning to reason with a restricted view
• Learning with restricted focus of attention
• On restricted-focus-of-attention learnability of Boolean functions
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Read-twice DNF formulas are properly learnable
• Structural results about exact learning with unspecified attribute values

Cited in

(11)

• Knowing what doesn't matter: exploiting the omission of irrelevant data
• Learning from examples with unspecified attribute values.
• Structural results about exact learning with unspecified attribute values
• Logical analysis of binary data with missing bits
• General lower bounds on the query complexity within the exact learning model
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• A general dimension for query learning
• DL-FOIL Concept Learning in Description Logics
• Learning definite Horn formulas from closure queries
• Partial observability and learnability

This page was built for publication: Learning from examples with unspecified attribute values.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401919)