%0 Journal Article
	%A Dhany Saputra and  Dayang R. A. Rambli and  Oi Mean Foong
	%D 2007
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 11, 2007
	%T Mining Sequential Patterns Using I-PrefixSpan
	%U https://publications.waset.org/pdf/14877
	%V 11
	%X 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.
	%P 3454 - 3459