Saputra , Dhany and Dayang R.A. Rambli, and Foong, Oi Mean (2008) Mining Sequential Patterns using I-PrefixSpan. [Citation Index Journal]
PDF
IJCSE_Spring_2008_Journal_Paper.pdf
Restricted to Registered users only
Download (422kB)
IJCSE_Spring_2008_Journal_Paper.pdf
Restricted to Registered users only
Download (422kB)
Abstract
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.
Item Type: | Citation Index Journal |
---|---|
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Departments / MOR / COE: | Departments > Computer Information Sciences |
Depositing User: | Foong Oi Mean |
Date Deposited: | 14 Apr 2010 06:15 |
Last Modified: | 19 Jan 2017 08:26 |
URI: | http://scholars.utp.edu.my/id/eprint/1159 |