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 |
| Published: |
World Academy of Science Engineering & Technology (WASET)
2008
|
| Subjects: | |
| Online Access: | http://eprints.utp.edu.my/1159/ http://eprints.utp.edu.my/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf |