Asking questions to minimize errors

DOI10.1006/JCSS.1996.0021zbMath0851.68094OpenAlexW4212783949MaRDI QIDQ1916529

Sally A. Goldman, Nader H. Bshouty, 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)

Related Items (17)

An algorithm to learn read-once threshold formulas, and transformations between learning models ⋮ Efficient multiple constraint acquisition ⋮ The query complexity of learning DFA ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Simple learning algorithms using divide and conquer ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Learning recursive functions: A survey ⋮ On the limits of proper learnability of subclasses of DNF formulas ⋮ Constraint acquisition ⋮ A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions ⋮ Learning conditional preference networks ⋮ Exact learning of DNF formulas using DNF hypotheses ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ The query complexity of finding local minima in the lattice ⋮ Theory revision with queries: Horn, read-once, and parity formulas

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