Mining for frequent episodes has been an active research area in recent years. Numerous algorithms have been developed to discover different types of episodes, where most of them adopt an a priori-like approach that generates candidates and then recognises these candidates to determine their support. However, such methods are computationally expensive, depending on the size and structure of the input data. Within this paper a tree growth based method is presented discovering episodes without candidate generation. The presented method only consists of a recognition phase that dynamically extends a specialised tree structure to efficiently store and process episodes.
[1]
Heikki Mannila,et al.
Discovery of Frequent Episodes in Event Sequences
,
1997,
Data Mining and Knowledge Discovery.
[2]
Ming-Syan Chen,et al.
Utilizing Slice Scan and Selective Hash for Episode Mining
,
2001
.
[3]
Heikki Mannila,et al.
Discovering Frequent Episodes in Sequences
,
1995,
KDD.
[4]
Rakesh Agarwal,et al.
Fast Algorithms for Mining Association Rules
,
1994,
VLDB 1994.
[5]
Jian Pei,et al.
Mining frequent patterns by pattern-growth: methodology and implications
,
2000,
SKDD.