Using finite state automata for sequence mining

  • Authors:
  • Philip Hingston

  • Affiliations:
  • Edith Cowan University, Mt Lawley, WA

  • Venue:
  • ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.