Independence and port oracles for matroids, with an application to computational learning theory

Collette R. Coullard, Lisa Hellerstein

    Research output: Contribution to journalArticle

    Abstract

    Given a matroid M with distinguished element e, a port oracle with respect to e reports whether or not a given subset contains a circuit that contains e. The first main result of this paper is an algorithm for computing an e-based ear decomposition (that is, an ear decomposition every circuit of which contains element e) of a matroid using only a polynomial number of elementary operations and port oracle calls. In the case that M is binary, the incidence vectors of the circuits in the ear decomposition form a matrix representation for M. Thus, this algorithm solves a problem in computational learning theory; it learns the class of binary matroid port (BMP) functions with membership queries in polynomial time. In this context, the algorithm generalizes results of Angluin, Hellerstein, and Karpinski [1], and Raghavan and Schach [17], who showed that certain subclasses of the BMP functions are learnable in polynomial time using membership queries. The second main result of this paper is an algorithm for testing independence of a given input set of the matroid M. This algorithm, which uses the ear decomposition algorithm as a subroutine, uses only a polynomial number of elementary operations and port oracle calls. The algorithm proves a constructive version of an early theorem of Lehman [13], which states that the port of a connected matroid uniquely determines the matroid.

    Original languageEnglish (US)
    Pages (from-to)189-208
    Number of pages20
    JournalCombinatorica
    Volume16
    Issue number2
    StatePublished - 1996

    Fingerprint

    Computational Learning Theory
    Matroid
    Binary Matroid
    Polynomials
    Decomposition
    Decompose
    Polynomial time
    Query
    Networks (circuits)
    Polynomial
    Matrix Representation
    Decomposition Algorithm
    Independence
    Subroutines
    Incidence
    Binary
    Testing
    Generalise
    Subset
    Computing

    ASJC Scopus subject areas

    • Mathematics(all)
    • Discrete Mathematics and Combinatorics

    Cite this

    Independence and port oracles for matroids, with an application to computational learning theory. / Coullard, Collette R.; Hellerstein, Lisa.

    In: Combinatorica, Vol. 16, No. 2, 1996, p. 189-208.

    Research output: Contribution to journalArticle

    Coullard, Collette R. ; Hellerstein, Lisa. / Independence and port oracles for matroids, with an application to computational learning theory. In: Combinatorica. 1996 ; Vol. 16, No. 2. pp. 189-208.
    @article{09c978136abe4061a98a90af4146275a,
    title = "Independence and port oracles for matroids, with an application to computational learning theory",
    abstract = "Given a matroid M with distinguished element e, a port oracle with respect to e reports whether or not a given subset contains a circuit that contains e. The first main result of this paper is an algorithm for computing an e-based ear decomposition (that is, an ear decomposition every circuit of which contains element e) of a matroid using only a polynomial number of elementary operations and port oracle calls. In the case that M is binary, the incidence vectors of the circuits in the ear decomposition form a matrix representation for M. Thus, this algorithm solves a problem in computational learning theory; it learns the class of binary matroid port (BMP) functions with membership queries in polynomial time. In this context, the algorithm generalizes results of Angluin, Hellerstein, and Karpinski [1], and Raghavan and Schach [17], who showed that certain subclasses of the BMP functions are learnable in polynomial time using membership queries. The second main result of this paper is an algorithm for testing independence of a given input set of the matroid M. This algorithm, which uses the ear decomposition algorithm as a subroutine, uses only a polynomial number of elementary operations and port oracle calls. The algorithm proves a constructive version of an early theorem of Lehman [13], which states that the port of a connected matroid uniquely determines the matroid.",
    author = "Coullard, {Collette R.} and Lisa Hellerstein",
    year = "1996",
    language = "English (US)",
    volume = "16",
    pages = "189--208",
    journal = "Combinatorica",
    issn = "0209-9683",
    publisher = "Janos Bolyai Mathematical Society",
    number = "2",

    }

    TY - JOUR

    T1 - Independence and port oracles for matroids, with an application to computational learning theory

    AU - Coullard, Collette R.

    AU - Hellerstein, Lisa

    PY - 1996

    Y1 - 1996

    N2 - Given a matroid M with distinguished element e, a port oracle with respect to e reports whether or not a given subset contains a circuit that contains e. The first main result of this paper is an algorithm for computing an e-based ear decomposition (that is, an ear decomposition every circuit of which contains element e) of a matroid using only a polynomial number of elementary operations and port oracle calls. In the case that M is binary, the incidence vectors of the circuits in the ear decomposition form a matrix representation for M. Thus, this algorithm solves a problem in computational learning theory; it learns the class of binary matroid port (BMP) functions with membership queries in polynomial time. In this context, the algorithm generalizes results of Angluin, Hellerstein, and Karpinski [1], and Raghavan and Schach [17], who showed that certain subclasses of the BMP functions are learnable in polynomial time using membership queries. The second main result of this paper is an algorithm for testing independence of a given input set of the matroid M. This algorithm, which uses the ear decomposition algorithm as a subroutine, uses only a polynomial number of elementary operations and port oracle calls. The algorithm proves a constructive version of an early theorem of Lehman [13], which states that the port of a connected matroid uniquely determines the matroid.

    AB - Given a matroid M with distinguished element e, a port oracle with respect to e reports whether or not a given subset contains a circuit that contains e. The first main result of this paper is an algorithm for computing an e-based ear decomposition (that is, an ear decomposition every circuit of which contains element e) of a matroid using only a polynomial number of elementary operations and port oracle calls. In the case that M is binary, the incidence vectors of the circuits in the ear decomposition form a matrix representation for M. Thus, this algorithm solves a problem in computational learning theory; it learns the class of binary matroid port (BMP) functions with membership queries in polynomial time. In this context, the algorithm generalizes results of Angluin, Hellerstein, and Karpinski [1], and Raghavan and Schach [17], who showed that certain subclasses of the BMP functions are learnable in polynomial time using membership queries. The second main result of this paper is an algorithm for testing independence of a given input set of the matroid M. This algorithm, which uses the ear decomposition algorithm as a subroutine, uses only a polynomial number of elementary operations and port oracle calls. The algorithm proves a constructive version of an early theorem of Lehman [13], which states that the port of a connected matroid uniquely determines the matroid.

    UR - http://www.scopus.com/inward/record.url?scp=0040521673&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0040521673&partnerID=8YFLogxK

    M3 - Article

    VL - 16

    SP - 189

    EP - 208

    JO - Combinatorica

    JF - Combinatorica

    SN - 0209-9683

    IS - 2

    ER -