Using Finite State Automata for Sequence Mining
Document Type
Conference Proceeding
Faculty
Faculty of Computing, Health and Science
School
School of Computer and Information Science
RAS ID
1283
Abstract
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.
Comments
Hingston, P. (2002, January). Using finite state automata for sequence mining. In Australian Computer Science Communications (Vol. 24, No. 1, pp. 105-110). Australian Computer Society, Inc..