Exploració per tema "PDFA"

Ara es mostren els items 1-3 de 3

    • A lower bound for learning distributions generated by probabilistic automata 

      Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard (Springer, 2010)
      Text en actes de congrés
      Accés obert
      Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. ...

    • Adaptively learning probabilistic deterministic automata from data streams 

      Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard (2014-07)
      Article
      Accés restringit per política de l'editorial
      Markovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ...

    • Learning PDFA with asynchronous transitions 

      Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard (Springer, 2010)
      Comunicació de congrés
      Accés obert
      In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time lengths, governed by exponential distributions.