Mostra el registre d'ítem simple
The Complexity of learning minor closed graph classes
dc.contributor.author | Domingo Soriano, Carlos |
dc.contributor.author | Shawe-Taylor, J |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-01-29T11:21:01Z |
dc.date.available | 2016-01-29T11:21:01Z |
dc.date.issued | 1995-04 |
dc.identifier.citation | Domingo, C., Shawe-Taylor, J. "The Complexity of learning minor closed graph classes". 1995. |
dc.identifier.uri | http://hdl.handle.net/2117/82263 |
dc.description.abstract | The paper considers the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of the class is in terms of a set of minimal excluded minors (obstruction set). Moreover, a negative result for learning such classes using only equivalence queries is also provided, after introducing a notion of reducibility between query learning problems. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Complexity |
dc.subject.other | Learning classes of graphs |
dc.title | The Complexity of learning minor closed graph classes |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1901873 |
dc.description.version | Postprint (published version) |
local.citation.author | Domingo, C.; Shawe-Taylor, J. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]