Learning Minor Closed Graph Classes with Membership and Equivalence Queries
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).
Domingo, Carlos
dcb16701-0230-45cb-b12e-6dcceb1cedc8
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Bodlaender, Hans
5b486c4a-c930-4afd-a5f6-d6821193878d
Abello, James
b294d539-be02-4e71-bf93-23523ddb4b1d
1994
Domingo, Carlos
dcb16701-0230-45cb-b12e-6dcceb1cedc8
Shawe-Taylor, John
b1931d97-fdd0-4bc1-89bc-ec01648e928b
Bodlaender, Hans
5b486c4a-c930-4afd-a5f6-d6821193878d
Abello, James
b294d539-be02-4e71-bf93-23523ddb4b1d
Domingo, Carlos, Shawe-Taylor, John, Bodlaender, Hans and Abello, James
(1994)
Learning Minor Closed Graph Classes with Membership and Equivalence Queries
Record type:
Monograph
(Project Report)
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).
Text
nc-tr-94-014.pdf
- Other
More information
Published date: 1994
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259758
URI: http://eprints.soton.ac.uk/id/eprint/259758
PURE UUID: 72146d48-1cac-4c09-90fe-4f1f31f643b6
Catalogue record
Date deposited: 12 Aug 2004
Last modified: 14 Mar 2024 06:27
Export record
Contributors
Author:
Carlos Domingo
Author:
John Shawe-Taylor
Author:
Hans Bodlaender
Author:
James Abello
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics