Learning nearly monotone \(k\)-term DNF

DOI10.1016/S0020-0190(98)00090-8zbMath1338.68134OpenAlexW1965057813MaRDI QIDQ293322

David Guijarro, Víctor Lavín, Jorge E. Castro

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000908?np=y

zbMATH Keywords

Kolmogorov complexityconcept learningquery learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Learning a subclass of \(k\)-quasi-Horn formulas with membership queries ⋮ A new abstract combinatorial dimension for exact learning via queries

Cites Work

• Fast learning of \(k\)-term DNF formulas with queries.
• Learning regular sets from queries and counterexamples
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Learning Simple Concepts under Simple Distributions

This page was built for publication: Learning nearly monotone \(k\)-term DNF