Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LEARNING FROM POSITIVE SAMPLES:
Reports tagged with learning from positive samples:
TR17-114 | 1st July 2017
Maciej Li\'skiewicz, Matthias Lutter, RĂ¼diger Reischuk

Proper Learning of k-term DNF Formulas from Satisfying Assignments

In certain applications there may only be positive samples available to
to learn concepts of a class of interest,
and this has to be done properly, i.e. the
hypothesis space has to coincide with the concept class,
and without false positives, i.e. the hypothesis always has be a subset ... more >>>




ISSN 1433-8092 | Imprint