Learning nearly monotone k-term DNF
From MaRDI portal
Publication:293322
DOI10.1016/S0020-0190(98)00090-8zbMATH Open1338.68134OpenAlexW1965057813MaRDI QIDQ293322FDOQ293322
Authors: David Guijarro, Víctor Lavín, Jorge 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
Recommendations
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
Cited In (14)
- DKL: an efficient algorithm for learning deterministic Kripke structures
- Learning Random Monotone DNF
- A new abstract combinatorial dimension for exact learning via queries
- On Exact Learning Monotone DNF from Membership Queries
- The monotone theory for the PAC-model.
- ILP Through Propositionalization and Stochastic k-Term DNF Learning
- Proper learning of \(k\)-term DNF formulas from satisfying assignments
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- Learning k-Term Monotone Boolean Formulae.
- Fast learning of \(k\)-term DNF formulas with queries.
- Title not available (Why is that?)
- The learnability of exclusive-or expansions based on monotone DNF formulas
- Learning Pseudo-Boolean k-DNF and Submodular Functions
- 10.1162/153244303768966094
This page was built for publication: Learning nearly monotone \(k\)-term DNF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293322)