Recent Submissions

  • Canonical Horn representations and query learning 

    Arias Vicente, Marta; Balcázar Navarro, José Luis (2009-05)
    External research report
    Open Access
    We describe an alternative construction of an existing canonical representation for definite Horn theories, the emph{Guigues-Duquenne} basis (or GD basis), which minimizes a natural notion of implicational size. We extend ...
  • Note: More efficient conversion of equivalence-query algorithms to PAC algorithms 

    Gavaldà Mestre, Ricard (2009-05)
    External research report
    Open Access
    We present a method for transforming an Equivalence-query algorithm using Q queries into a PAC-algorithm using Q/epsilon + O( (Q^(2/3) / epsilon ) * log(Q / delta) examples in expectation. The method is a variation of that ...
  • Adaptive parameter-free learning from evolving data streams 

    Bifet Figuerol, Albert Carles; Gavaldà Mestre, Ricard (2009-03)
    External research report
    Open Access
    We propose and illustrate a method for developing algorithms that can adaptively learn from data streams that change over time. As an example, we take Hoeffding Tree, an incremental decision tree inducer for data streams, ...
  • An optimal anytime estimation algorithm 

    Gavaldà Mestre, Ricard (2004-12)
    External research report
    Open Access
    In many applications a key step is estimating some unknown quantity ~$mu$ from a sequence of trials, each having expected value~$mu$. Optimal algorithms are known when the task is to estimate $mu$ within a multiplicative ...
  • Tractable clones of polynomials over semigroups 

    Dalmau, Víctor; Gavaldà Mestre, Ricard; Tesson, Pascal; Thérien, Denis (2005-12)
    External research report
    Open Access
    We contribute to the algebraic study of the complexity of constraint satisfaction problems. We give a new sufficient condition on a set of relations R over a domain S for the tractability of CSP(R): if S is a block-group ...
  • Spectral learning of transducers over continuous sequences 

    Recasens, Adria; Quattoni, Ariadna Julieta (2013-01-01)
    External research report
    Open Access
    In this paper we present a spectral algorithm for learning weighted nite state transducers (WFSTs) over paired input-output sequences, where the input is continuous and the output discrete. WFSTs are an important tool for ...
  • Frequent sets, sequences and taxonomies: new efficient algorithmic proposals 

    Baixeries i Juvillà, Jaume; Casas Garriga, Gemma; Balcázar Navarro, José Luis (2000)
    External research report
    Open Access
    We describe efficient algorithmic proposals to approach three fundamental problems in data mining: association rules, episodes in sequences, and generalized association rules over hierarchical taxonomies. The association ...
  • An integer linear programming representation for data-center power-aware management 

    Berral García, Josep Lluís; Gavaldà Mestre, Ricard; Torres Viñals, Jordi (2010-11-12)
    External research report
    Open Access
    This work exposes how to represent a grid data-center based scheduling problem, taking the advantages of the virtualization and consolidation techniques, as a linear integer programming problem including all three mentioned ...

View more