Now showing items 1-11 of 11

  • A New abstract combinatorial dimension for exact learning via queries 

    Balcázar Navarro, José Luis; Castro Rabal, Jorge; Guijarro Guillem, David (2000-02)
    External research report
    Open Access
    We introduce an abstract model of exact learning via queries that can be instantiated to all the query learning models currently in use, while being closer to them than previous unificatory attempts. We present a ...
  • AwaZza, recerca viatjant cap a producte 

    Guijarro Guillem, David (2014-04-03)
    Audiovisual
    Open Access
    La transferència de tecnologia dels laboratoris de recerca fins a l'explotació comercial no és un camí fàcil ni tant sols per als productes de software. AwaZza ens serveix d'exemple de les fases i dificultats trobades pel ...
  • Exact learning when irrelevant variables abound 

    Guijarro Guillem, David; Lanvín, Víctor; Raghavan, Vijay (1998-11-02)
    External research report
    Open Access
    We prove the following results. Any Boolean function of O(log n) relevant variables can be exactly learned with a set of non-adaptive membership queries alone and a minimum sized decision tree representation of the ...
  • Finding relevant variables in PAC model with membership queries 

    Guijarro Guillem, David; Tarui, Jun; Tsukiji, Tatsuie (1999-12)
    External research report
    Open Access
    A new research frontier in AI and data mining seeks to develop methods to automatically discover relevant variables among many irrelevant ones. In this paper, we present four algorithms that output such crucial variables ...
  • Learning monotone term decision lists 

    Guijarro Guillem, David; Lavín Puente, Víctor Angel; Raghavan, Vijay (1996-09)
    External research report
    Open Access
    We study the learnability of monotone term decision lists in the exact model of equivalence and membership queries. We show that, for any constant k>0, k-term monotone decision lists are exactly and properly learnable with ...
  • Learning nearly monotone k-term DNF 

    Castro Rabal, Jorge; Guijarro Guillem, David; Lavín Puente, Víctor Angel (1996-09)
    External research report
    Open Access
    This note studies the learnability of the class k-term DNF with a bounded number of negations per term. We study the case of learning with membership queries alone, and give tight upper and lower bounds on the ...
  • Learning ordered binary decision diagrams 

    Gavaldà Mestre, Ricard; Guijarro Guillem, David (1995-03)
    External research report
    Open Access
    We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. ...
  • Monotone term decision lists 

    Guijarro Guillem, David; Lavín Puente, Víctor Angel; Raghavan, V (1998-11)
    External research report
    Open Access
    We introduce a new representation class of Boolean functions---monotone term decision lists---which combines compact representation size with tractability of essential operations. We present many properties of the class ...
  • On the learnability of output-DFA: a proof and an implementation 

    Domingo, Carlos; Guijarro Guillem, David (1993-03)
    External research report
    Open Access
    This paper presents an algorithm that learns Output-DFA by making Evaluation and Equivalence queries. The correctness and termination of the algorithm are discussed. A description of the implementation of the algorithm is ...
  • Query, PACS and simple-PAC learning 

    Castro Rabal, Jorge; Guijarro Guillem, David (1998-01)
    External research report
    Open Access
    We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron, with the standard simple-PAC ...
  • The Consistency dimension and distribution-dependent learning from queries: (extended abstract with appendices) 

    Balcázar Navarro, José Luis; Castro Rabal, Jorge; Guijarro Guillem, David; Simon, Hans-Ulrich (1999-12)
    External research report
    Open Access
    We prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via equivalence and membership ...