Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/82263

The Complexity of learning minor closed graph classes
Domingo Soriano, Carlos; Shawe-Taylor, J
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
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.
Àrees temàtiques de la UPC::Informàtica
Complexity
Learning classes of graphs
info:eu-repo/semantics/publishedVersion
Informe
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Domingo Soriano, Carlos; Lavín Puente, Víctor Angel
Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu
Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, O
Domingo Soriano, Carlos; Watanabe, O; Yamazaki, T
Domingo Soriano, Carlos; Gavaldà Mestre, Ricard; Watanabe, Osamu