Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A Note on learning decision lists

Autor
Castro, J.
Tipus d'activitat
Document cientificotècnic
Data
1995-01
Codi
LSI-95-2-R
Repositori
http://hdl.handle.net/2117/96750 Obrir en finestra nova
Resum
We show an algorithm that learns decision lists via equivalence queries, provided that a set G including all terms of the target list is given. The algorithm runs in time polynomial in the cardinality of G. From this last learning algorithm, we prove that log n-decision lists - the class of decision lists such that all their terms have low Kolmogorov complexity - are simple pac-learnable.
Citació
Castro, J. "A Note on learning decision lists". 1995.
Paraules clau
Learning algorithm, Learning decision lists
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants

Arxius