Mostra el registre d'ítem simple
Simple PAC learning of simple decision lists
dc.contributor.author | Castro Rabal, Jorge |
dc.contributor.author | Balcázar Navarro, José Luis |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-02T14:41:56Z |
dc.date.available | 2016-02-02T14:41:56Z |
dc.date.issued | 1995-06 |
dc.identifier.citation | Castro, J., Balcazar, J. L. "Simple PAC learning of simple decision lists". 1995. |
dc.identifier.uri | http://hdl.handle.net/2117/82442 |
dc.description.abstract | We prove that log n-decision lists - the class of decision lists such that all their terms have low Kolmogorov complexity - are learnable in the simple PAC learning model. The proof is based on a transformation from an algorithm based on equivalence queries (found independently by Simon). Then we introduce the class of simple decision lists, and extend our algorithm to show that simple decision lists are simple-PAC learnable as well. This last result is relevant in that it is, to our knowledge, the first learning algorithm for decision lists in which an exponentially wide set of functions may be used for the terms. (This report supersedes LSI-95-2-R.) |
dc.format.extent | 19 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | PAC learning |
dc.subject.other | Decision lists |
dc.title | Simple PAC learning of simple decision lists |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1837744 |
dc.description.version | Postprint (published version) |
local.citation.author | Castro, J.; Balcazar, J. L. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]