Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/96475
|
Título:
|
Exact learning of subclasses of CDNF formulas with membership queries
|
|
Autor/a:
|
Domingo, Carlos
|
|
Abstract:
|
We consider the exact learnability of subclasses of
Boolean formulas from membership queries alone.
We show how to combine known learning algorithms
that use membership and equivalence queries
to obtain new learning results only with memberships.
In particular we show the exact learnability of
read-k monotone formulas, Sat-k O(log n)-CDNF,
and O(sqrt{log n})-size CDNF from membership queries only. |
|
Abstract:
|
_ |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica
-Learnability
-Boolean formulas
-Learning algorithms
-CDNF |
|
Derechos:
|
|
|
Tipo de documento:
|
Informe |
|
Compartir:
|
|
Mostrar el registro completo del ítem
