One of the important steps in mining event sequences is to find frequent episodes. Once the frequent episodes are discovered, rules about temporal relationships can he derived. In this paper, an cfficient algorithm fo...One of the important steps in mining event sequences is to find frequent episodes. Once the frequent episodes are discovered, rules about temporal relationships can he derived. In this paper, an cfficient algorithm for discovering frequent episodes is presented based on the level-wise search algorithm WINEPI. The proposed algorithm gains hetter candidate generation quality by introducing a new Lemma to help to target the combinations of episodes that are interesting in the next level and thins reduces the execution time. Experimental results on artificial and real data show the enhanced efficiency of the algorithm.展开更多
文摘One of the important steps in mining event sequences is to find frequent episodes. Once the frequent episodes are discovered, rules about temporal relationships can he derived. In this paper, an cfficient algorithm for discovering frequent episodes is presented based on the level-wise search algorithm WINEPI. The proposed algorithm gains hetter candidate generation quality by introducing a new Lemma to help to target the combinations of episodes that are interesting in the next level and thins reduces the execution time. Experimental results on artificial and real data show the enhanced efficiency of the algorithm.
