Mining algorithm of frequent episodes in an event sequence based on generalized suffix-tree

QU Wenlong; YANG Bingru; ZHANG Kejun

doi:10.13374/j.issn1001-053x.2006.05.039

Volume 28 Issue 5

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2006 > 28(5): 490-496

QU Wenlong, YANG Bingru, ZHANG Kejun. Mining algorithm of frequent episodes in an event sequence based on generalized suffix-tree[J]. Chinese Journal of Engineering, 2006, 28(5): 490-496. doi: 10.13374/j.issn1001-053x.2006.05.039

Citation:

QU Wenlong, YANG Bingru, ZHANG Kejun. Mining algorithm of frequent episodes in an event sequence based on generalized suffix-tree[J]. Chinese Journal of Engineering, 2006, 28(5): 490-496. doi: 10.13374/j.issn1001-053x.2006.05.039

Citation:

PDF( 702 KB)

Mining algorithm of frequent episodes in an event sequence based on generalized suffix-tree

doi: 10.13374/j.issn1001-053x.2006.05.039

1. Shijiazhuang University of Economics, Shijiazhuang 050031, China;
2. Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China

Received Date: 2005-03-14
Rev Recd Date: 2005-10-11

Available Online: 2021-08-24

Abstract

Abstract

In order to mine frequent episodes from an event sequence efficiently, an algorithm based on generalized suffix-tree was proposed to discover and store frequent episodes, which uses the concept of generalized suffix and contains only frequent episodes' nodes. The occurrence list of frequent episodes was used layer-upon-layer to improve the efficiency of the tree. The algorithm make full use of the order character of an event sequence and may discover the variety of frequent episodes. Experimental results show that the proposed algorithm is superior in runtime to Apriori-like frequent episodes mining algorithm.
- event sequence,
- frequent episodes,
- data mining,
- generalized suffix tree