Asking questions to minimize errors

DOI10.1006/JCSS.1996.0021MaRDI QIDQ1916529zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar

Publication date 8 July 1996

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1311&context=cse_research

zbMATH Keywords

learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Malicious omissions and errors in answers to membership queries
• Fast learning of \(k\)-term DNF formulas with queries.
• Exact learning of DNF formulas using DNF hypotheses
• Queries and concept learning

Cited in

(26)

• An algorithm to learn read-once threshold formulas, and transformations between learning models
• The query complexity of learning DFA
• Simple learning algorithms using divide and conquer
• Malicious omissions and errors in answers to membership queries
• Non-adaptive learning of a hidden hypergraph
• The learnability of unions of two rectangles in the two-dimensional discretized space
• Even linear simple matrix languages: formal language properties and grammatical inference.
• The query complexity of finding local minima in the lattice
• Online learning of binary and \(n\)-ary relations over clustered domains.
• Structural results about on-line learning models with and without queries
• Exact learning from an honest teacher that answers membership queries
• From equivalence queries to PAC learning: the case of implication theories
• Non-adaptive learning of a hidden hypergraph
• scientific article; zbMATH DE number 996384 (Why is no real title available?)
• scientific article; zbMATH DE number 67615 (Why is no real title available?)
• scientific article; zbMATH DE number 2086401 (Why is no real title available?)
• Constraint acquisition
• Exact learning of DNF formulas using DNF hypotheses
• On the limits of proper learnability of subclasses of DNF formulas
• How many missing answers can be tolerated by query learners?
• New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
• Theory revision with queries: Horn, read-once, and parity formulas
• Efficient multiple constraint acquisition
• Learning recursive functions: A survey
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• Learning conditional preference networks

This page was built for publication: Asking questions to minimize errors

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