PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Results of the PAutomaC Probabilistic Automaton Learning Competition
Sicco Verwer, Rémi Eyraud and Colin de la Higuera
JMLR Workshop and Conference Proceedings Volume 21, pp. 243-248, 2012.


Approximating distributions over strings is a hard learning problem. Typical GI techniques involve using finite state machines as models and attempting to learn both the structure and the weights, simultaneously. The PAutomaC competition is the first challenge to allow comparison between methods and algorithms and builds a first state of the art for these techniques. Both artificial data and real data were proposed and contestants were to try to estimate the probabilities of test strings. The purpose of this paper is to provide an overview of the implementation details of PAutomaC and to report the final results of the competition.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
ID Code:9614
Deposited By:Rémi Eyraud
Deposited On:01 December 2012