Learning Minor Closed Graph Classes with Membership and Equivalence Queries
Domingo, Carlos, Shawe-Taylor, John, Bodlaender, Hans and Abello, James (1994) Learning Minor Closed Graph Classes with Membership and Equivalence Queries.
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).
|Item Type:||Monograph (Technical Report)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||12 Aug 2004|
|Last Modified:||02 Mar 2012 12:40|
|Contributors:||Domingo, Carlos (Author)
Shawe-Taylor, John (Author)
Bodlaender, Hans (Author)
Abello, James (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)