Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/83105

Learning monotone term decision lists
Guijarro Guillem, David; Lavín Puente, Víctor Angel; Raghavan, Vijay
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
We study the learnability of monotone term decision lists in the exact model of equivalence and membership queries. We show that, for any constant k>0, k-term monotone decision lists are exactly and properly learnable with n^O(k) membership queries in O(n^(k^3)) time. We also show n^Omega(k) membership queries are necessary for exact learning. In contrast, both k-term monotone decision lists (k>1) and general monotone decision lists are not learnable with equivalence queries alone.
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Learning monotone
Decision lists
info:eu-repo/semantics/publishedVersion
Informe
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Lavín Puente, Víctor Angel; Raghavan, Vijay
Guijarro Guillem, David; Lavín Puente, Víctor Angel; Raghavan, V
Castro Rabal, Jorge; Guijarro Guillem, David; Lavín Puente, Víctor Angel
Domingo Soriano, Carlos; Lavín Puente, Víctor Angel
Balcázar Navarro, José Luis; Castro Rabal, Jorge; Guijarro Guillem, David; Simon, Hans-Ulrich