Using Finite State Automata for Sequence Mining

We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the model.

• Type: Conference
• Year: 2002
• Where: ACSC
• Authors: Philip Hingston
• Keywords: ACSC 2002, Large Datasets, Sequential Patterns, State Automaton Model, Theoretical Computer Science