Advances in Intelligent Data Analysis Reasoning about Data

Volume 1280 of the series Lecture Notes in Computer Science pp 573-584


Modelling discrete event sequences as state transition diagrams

  • Adele E. HoweAffiliated withComputer Science Dept, Colorado State University
  • , Gabriel SomloAffiliated withComputer Science Dept, Colorado State University

* Final gross prices may vary according to local VAT.

Get Access


Discrete event sequences have been modeled with two types of representation: snapshots and overviews. Snapshot models describe the process as a collection of relatively short sequences. Overview models collect key relationships into a single structure, providing an integrated but abstract view. This paper describes a new algorithm for constructing one type of overview model: state transition diagrams. The algorithm, called State Transition Dependency Detection (STDD), is the latest in a family of statistics based algorithms for modeling event sequences called Dependency Detection. We present accuracy results for the algorithm on synthetic data and data from the execution of two AI systems.