Título:
|
Learning nearly monotone k-term DNF
|
Autor/a:
|
Castro Rabal, Jorge; Guijarro Guillem, David; Lavín Puente, Víctor Angel
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
This note studies the learnability of
the class k-term DNF with a bounded number of
negations per term.
We study
the case of learning with membership queries alone, and
give tight upper and lower bounds on the number of
negations that makes
the learning task feasible.
We also prove a negative result for equivalence queries.
Finally, we show that a slight modification in our
algorithm proves
that the considered class is also learnable in the
Simple PAC model,
extending Li and Vitányi result for
monotone k-term DNF. |
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -DNF -Learning monotone |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Informe |
Compartir:
|
|