Monotone term decision lists

We introduce a new representation class of Boolean functions---monotone term decision lists---which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation...

Descripción completa

Detalles Bibliográficos
Autores: Guijarro Guillem, David, Lavín Puente, Víctor Angel, Raghavan, V
Tipo de recurso: informe técnico
Fecha de publicación:1998
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/84906
Acceso en línea:https://hdl.handle.net/2117/84906
Access Level:acceso abierto
Palabra clave:Boolean functions
Monotone terms decision lists
Representation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_e82ff852fb1eee3f2bd3886b80eec3cc
oai_identifier_str oai:upcommons.upc.edu:2117/84906
network_acronym_str ES
network_name_str España
repository_id_str
spelling Monotone term decision listsGuijarro Guillem, DavidLavín Puente, Víctor AngelRaghavan, VBoolean functionsMonotone terms decision listsRepresentationÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaWe introduce a new representation class of Boolean functions---monotone term decision lists---which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. 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 n^(O(k^3)) time. We also show that n^(Omega (k)) membership queries are necessary for exact learning. In contrast, both k-term monotone decision lists (k >= 2) and general monotone term decision lists are not learnable with equivalence queries alone. We also show that a subclass of monotone term decision lists (disj-MDL) is learnable with equivalence and membership queries, while neither type of query alone suffices.19981998-11-0120162016-03-30reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/84906reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/849062026-05-27T15:37:01Z
dc.title.none.fl_str_mv Monotone term decision lists
title Monotone term decision lists
spellingShingle Monotone term decision lists
Guijarro Guillem, David
Boolean functions
Monotone terms decision lists
Representation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Monotone term decision lists
title_full Monotone term decision lists
title_fullStr Monotone term decision lists
title_full_unstemmed Monotone term decision lists
title_sort Monotone term decision lists
dc.creator.none.fl_str_mv Guijarro Guillem, David
Lavín Puente, Víctor Angel
Raghavan, V
author Guijarro Guillem, David
author_facet Guijarro Guillem, David
Lavín Puente, Víctor Angel
Raghavan, V
author_role author
author2 Lavín Puente, Víctor Angel
Raghavan, V
author2_role author
author
dc.subject.none.fl_str_mv Boolean functions
Monotone terms decision lists
Representation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Boolean functions
Monotone terms decision lists
Representation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description We introduce a new representation class of Boolean functions---monotone term decision lists---which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. 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 n^(O(k^3)) time. We also show that n^(Omega (k)) membership queries are necessary for exact learning. In contrast, both k-term monotone decision lists (k >= 2) and general monotone term decision lists are not learnable with equivalence queries alone. We also show that a subclass of monotone term decision lists (disj-MDL) is learnable with equivalence and membership queries, while neither type of query alone suffices.
publishDate 1998
dc.date.none.fl_str_mv 1998
1998-11-01
2016
2016-03-30
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/84906
url https://hdl.handle.net/2117/84906
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422919578288128
score 15,300724

Similares en LA Referencia