Stream prediction using a generative model based on frequent episodes in event sequences

This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wish to predict. The algorithm examines windows of events that precede occurrences of the target event types in historical data. The set of significant frequent episodes associated with each target event type is obtained based on formal connections between frequent episodes and Hidden Markov Models (HMMs). Each significant episode is associated with a specialized HMM, and a mixture of such HMMs is estimated for every target event type. The likelihoods of the current window of events, under these mixture models, are used to predict future occurrences of target events in the data. The only user-defined model parameter in the algorithm is the length of the windows of events used during model estimation. We first evaluate the algorithm on synthetic data that was generated by embedding (in varying levels of noise) pa...

• Type: Conference
• Year: 2008
• Where: KDD
• Authors: Srivatsan Laxman, Vikram Tankasali, Ryen W. White
• Keywords: Algorithm Examines Windows, Data Mining, KDD 2008, Target Event Type, Target Event Types