Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Lavín Puente, Víctor Angel"'
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
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 al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e82ff852fb1eee3f2bd3886b80eec3cc
https://hdl.handle.net/2117/84906
https://hdl.handle.net/2117/84906
Autor:
Castro Rabal, Jorge|||0000-0002-1390-1313, Guijarro Guillem, David, Lavín Puente, Víctor Angel
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
This note studies the learnability of the class k-term DNF with a bounded number of negations per term. We study the case of learning with membership queries alone, and give tight upper and lower bounds on the number of negations that makes the learn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::86cd995e5dbc9fd62a6f523a991aa8f4
https://hdl.handle.net/2117/83098
https://hdl.handle.net/2117/83098
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
We prove that decision trees exhibit the "approximate fingerprint" property, and therefore are not polynomially learnable using only equivalence queries. A slight modification of the proof extends this result to several other representation classes o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::529eca019f6bf98b94bba8ce984d5812
http://hdl.handle.net/2117/82909
http://hdl.handle.net/2117/82909
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In the COLT'94 Conference A. Burago showed that the class of structurally reversible grammars is learnable in polynomial time using membership and equivalence queries. The paper shows that this class of grammars is not learnable using either membersh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::79aef8bbb54082acea6dda992b063ea3
https://hdl.handle.net/2117/97281
https://hdl.handle.net/2117/97281