Dhany Saputra and Dayang R. A. Rambli and Oi Mean Foong
Mining Sequential Patterns Using IPrefixSpan
3454 - 3459
2007
1
11
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/14877
https://publications.waset.org/vol/11
World Academy of Science, Engineering and Technology
In this paper, we propose an improvement of pattern
growthbased PrefixSpan algorithm, called IPrefixSpan. The general idea of IPrefixSpan is to use sufficient data structure for SeqTree
framework and separator database to reduce the execution time and
memory usage. Thus, with IPrefixSpan there is no inmemory 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.
Open Science Index 11, 2007