The Complexity of learning minor closed graph classes

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...

ver descrição completa

Detalhes bibliográficos
Autores: Domingo Soriano, Carlos, Shawe-Taylor, J
Formato: informe técnico
Fecha de publicación:1995
País:España
Recursos: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/82263
Acesso em linha:https://hdl.handle.net/2117/82263
Access Level:acceso abierto
Palavra-chave:Complexity
Learning classes of graphs
Àrees temàtiques de la UPC::Informàtica
id ES_d54f57e43d8085900873db032bc0706d
oai_identifier_str oai:upcommons.upc.edu:2117/82263
network_acronym_str ES
network_name_str España
repository_id_str
spelling The Complexity of learning minor closed graph classesDomingo Soriano, CarlosShawe-Taylor, JComplexityLearning classes of graphsÀrees temàtiques de la UPC::InformàticaThe 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.19951995-04-0120162016-01-29reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/82263reponame: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/822632026-05-27T15:37:01Z
dc.title.none.fl_str_mv The Complexity of learning minor closed graph classes
title The Complexity of learning minor closed graph classes
spellingShingle The Complexity of learning minor closed graph classes
Domingo Soriano, Carlos
Complexity
Learning classes of graphs
Àrees temàtiques de la UPC::Informàtica
title_short The Complexity of learning minor closed graph classes
title_full The Complexity of learning minor closed graph classes
title_fullStr The Complexity of learning minor closed graph classes
title_full_unstemmed The Complexity of learning minor closed graph classes
title_sort The Complexity of learning minor closed graph classes
dc.creator.none.fl_str_mv Domingo Soriano, Carlos
Shawe-Taylor, J
author Domingo Soriano, Carlos
author_facet Domingo Soriano, Carlos
Shawe-Taylor, J
author_role author
author2 Shawe-Taylor, J
author2_role author
dc.subject.none.fl_str_mv Complexity
Learning classes of graphs
Àrees temàtiques de la UPC::Informàtica
topic Complexity
Learning classes of graphs
Àrees temàtiques de la UPC::Informàtica
description 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.
publishDate 1995
dc.date.none.fl_str_mv 1995
1995-04-01
2016
2016-01-29
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/82263
url https://hdl.handle.net/2117/82263
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_ 1869420668499525632
score 15,198674

Registos relacionados