Mining Sequential Patterns using I-PrefixSpan
In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use sufficient data structure for Seq-Tree Framework and separator database to reduce the execution time and memory usage. Thus, with I-PrefixSpan there...
| Main Authors: | , , |
|---|---|
| Format: | Citation Index Journal |
| Language: | English |
| Published: |
World Academy of Science Engineering & Technology (WASET)
2008
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/1159/ http://scholars.utp.edu.my/id/eprint/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf |
| Summary: | In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use sufficient data structure for Seq-Tree Framework and separator database to reduce the execution time and memory usage. Thus, with I-PrefixSpan there is no in-memory database stored after index set is constructed. The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude. |
|---|