Sciweavers

245 search results - page 5 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
AAAI
2008
15 years 1 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp
90
Voted
ALT
2005
Springer
15 years 8 months ago
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
Nick Palmer, Paul W. Goldberg
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 3 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
FASE
2008
Springer
15 years 1 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt