A Note on learning decision lists

dc.contributor.author	Castro Rabal, Jorge
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-11-16T15:27:37Z
dc.date.available	2016-11-16T15:27:37Z
dc.date.issued	1995-01
dc.identifier.citation	Castro, J. "A Note on learning decision lists". 1995.
dc.identifier.uri	http://hdl.handle.net/2117/96750
dc.description.abstract	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.
dc.format.extent	19 p.
dc.language.iso	eng
dc.relation.ispartofseries	LSI-95-2-R
dc.subject	Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Aprenentatge automàtic
dc.subject.other	Learning decision lists
dc.subject.other	Learning algorithm
dc.title	A Note on learning decision lists
dc.type	External research report
dc.contributor.group	Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.rights.access	Open Access
local.identifier.drac	1881474
dc.description.version	Postprint (published version)
local.citation.author	Castro, J.

UPCommons. Portal del coneixement obert de la UPC