Pages that link to "Item:Q1900981"
From MaRDI portal
The following pages link to On the learnability of disjunctive normal form formulas (Q1900981):
Displaying 15 items.
- Learning random monotone DNF (Q628302) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- On using the Fourier transform to learn disjoint DNF (Q1318745) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs) (Q1801736) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- On learning visual concepts and DNF formulae (Q1916881) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- Grafting for combinatorial binary model using frequent itemset mining (Q2218401) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Learning Theory and Kernel Machines (Q5305883) (← links)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” (Q5741808) (← links)
