Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Exact learning of subclasses of CDNF formulas with membership queries

Autor
Domingo, C.
Tipus d'activitat
Document cientificotècnic
Data
1996-03-01
Codi
R96-22
Repositori
http://hdl.handle.net/2117/96475 Obrir en finestra nova
Resum
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.
Citació
Domingo, C. "Exact learning of subclasses of CDNF formulas with membership queries". 1996.
Paraules clau
Learnability, Boolean Formulas, Learning Algorithms, Cdnf

Participants

  • Domingo, Carlos  (autor)

Arxius