No abstract

No abstract

No abstract

Recurrent combinations of events within an event sequence, known as episodes, often reveal useful information.Most of the proposed episode mining algorithms adopt an apriori-like approach that generates candidates and then calculates their support levels. Obviously, such an approach is computationally expensive. Moreover, those algorithms are capable of handling only a limited range of constraints. In this paper, we introduce two mining algorithms -Episode Prefix Tree (EPT) and Position Pairs Set (PPS) -based on a prefix-growth approach to overcome the above limitations. Both algorithms push constraints systematically into the mining process. Performance study shows that the proposed algorithms run considerably faster than MINEPI [4]. * A full version of this paper can be retrieved from

No abstract