Publications


MixItUp Demo - Toggle Filtering AND Logic



Active Coevolutionary Learning of Deterministic Finite Automata

Journal of Machine Learning Research, 6, 1651-1678, 2005


Status: Published

Citations:

Cite: [bibtex]


My Image

Abstract: This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimation-exploration algorithm (EEA). This approach differs from previous passive and active learning approaches to grammatical inference in that training data is actively proposed by the algorithm, rather than passively receiving training data from some external teacher. Here we show that this algorithm outperforms one version of the most powerful set of algorithms for grammatical inference, evidence driven state merging (EDSM), on randomly-generated DFAs. The performance increase is due to the fact that the EDSM algorithm only works well for DFAs with specific balances (percentage of positive labelings), while the EEA is more consistent over a wider range of balances. Based on this finding we propose a more general method for generating DFAs to be used in the development of future grammatical inference algorithms.



[edit database entry]
Stacks Image 525289
(null)

  • Stacks Image 525371
    (null)
  • Stacks Image 525379
    (null)
  • Stacks Image 525375
    (null)


Stacks Image 525306
(null)

  • Stacks Image 525319
    (null)
  • Stacks Image 525314
    (null)
  • Stacks Image 525310
    (null)


Stacks Image 525327
(null)

  • Stacks Image 525331
    (null)
  • Stacks Image 525335
    (null)
  • Stacks Image 525339
    (null)


Stacks Image 525346
(null)

  • Stacks Image 525350
    (null)
  • Stacks Image 525354
    (null)
  • Stacks Image 525358
    (null)


Stacks Image 525386
(null)

  • Stacks Image 525390
    (null)
  • Stacks Image 525394
    (null)
  • Stacks Image 525398
    (null)