Srivatsan Laxman, P. S. Sastry, and K. P. Unnikrishnan
September 2007
This paper is concerned with the framework of frequent episode discovery in event sequences. A new temporal pattern, called the generalized episode, is defined, which extends this framework by incorporating event duration constraints explicitly into the pattern’s definition. This new formalism facilitates extension of the technique of episodes discovery to applications where data appears as a sequence of events that persist for different durations (rather than being instantaneous). We present efficient algorithms for episode discovery in this new framework. Through extensive simulations, we show the expressive power of the new formalism. We also show how the duration constraint possibilities can be used as a design choice to properly focus the episode discovery process. Finally, we briefly discuss some interesting results obtained on data from manufacturing plants of General Motors.
![]() PDF file |
In IEEE Transactions on Knowledge and Data Engineering
Publisher IEEE Computer Society
Copyright © 2007 IEEE. Reprinted from IEEE Computer Society.
This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
| Type | Article |
| Pages | 1188–1201 |
| Volume | 19 |
| Number | 9 |