Abstract
This paper fist demonstrates that current PrefixSpan-based incremental mining algorithm IncSpan+ which is proposed in PAKDD05 cannot completely mine all sequential patterns. Then a new incremental mining algorithm of sequential patterns using prefix tree is proposed. This algorithm constructs a prefix tree to represent the sequential patterns, and then continuously scans the incremental element set to maintain the tree structure, using width pruning and depth pruning to eliminate the search space. The experiment shows this algorithm has a good performance. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Yue, C., Jiankui, G., Yaqin, W., Yun, X., & Yangyong, Z. (2007). Incremental mining of sequential patterns using prefix tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4426 LNAI, pp. 433–440). https://doi.org/10.1007/978-3-540-71701-0_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
