Discovering frequent episodes and learning Hidden Markov Models: A formal connection

Srivatsan Laxman, P. S. Sastry, and K. P. Unnikrishnan

Abstract

This paper establishes a formal connection between two common, but previously unconnected methods for analyzing data streams: discovering frequent episodes in a computer science framework and learning generative models in a statistics framework. We introduce a special class of discrete Hidden Markov Models (HMMs), called Episode Generating HMMs (EGHs), and associate each episode with a unique EGH. We prove that, given any two episodes, the EGH that is more likely to generate a given data sequence is the one associated with the more frequent episode. To be able to establish such a relationship, we define a new measure of frequency of an episode, based on what we call nonoverlapping occurrences of the episode in the data. An efficient algorithm is proposed for counting the frequencies for a set of episodes. Through extensive simulations, we show that our algorithm is both effective and more efficient than current methods for frequent episode discovery. We also show how the association between frequent episodes and EGHs can be exploited to assess the significance of frequent episodes discovered and illustrate empirically how this idea may be used to improve the efficiency of the frequent episode discovery.

Details

Publication typeArticle
Published inIEEE Transactions on Knowledge and Data Engineering
Pages1505–1517
Volume17
Number11
PublisherIEEE Computer Society
> Publications > Discovering frequent episodes and learning Hidden Markov Models: A formal connection