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 |
| _version_ | 1848659080964472832 |
|---|---|
| author | Saputra , Dhany Dayang R.A. Rambli, Foong, Oi Mean |
| author_facet | Saputra , Dhany Dayang R.A. Rambli, Foong, Oi Mean |
| author_sort | Saputra , Dhany |
| building | UTP Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-13T07:24:45Z |
| format | Citation Index Journal |
| id | oai:scholars.utp.edu.my:1159 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:24:45Z |
| publishDate | 2008 |
| publisher | World Academy of Science Engineering & Technology (WASET) |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:11592017-01-19T08:26:17Z http://scholars.utp.edu.my/id/eprint/1159/ Mining Sequential Patterns using I-PrefixSpan Saputra , Dhany Dayang R.A. Rambli, Foong, Oi Mean QA75 Electronic computers. Computer science 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. World Academy of Science Engineering & Technology (WASET) 2008-04 Citation Index Journal PeerReviewed application/pdf en http://scholars.utp.edu.my/id/eprint/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf Saputra , Dhany and Dayang R.A. Rambli, and Foong, Oi Mean (2008) Mining Sequential Patterns using I-PrefixSpan. [Citation Index Journal] |
| spellingShingle | QA75 Electronic computers. Computer science Saputra , Dhany Dayang R.A. Rambli, Foong, Oi Mean Mining Sequential Patterns using I-PrefixSpan |
| title | Mining Sequential Patterns using I-PrefixSpan |
| title_full | Mining Sequential Patterns using I-PrefixSpan |
| title_fullStr | Mining Sequential Patterns using I-PrefixSpan |
| title_full_unstemmed | Mining Sequential Patterns using I-PrefixSpan |
| title_short | Mining Sequential Patterns using I-PrefixSpan |
| title_sort | mining sequential patterns using i-prefixspan |
| topic | QA75 Electronic computers. Computer science |
| url | http://scholars.utp.edu.my/id/eprint/1159/ http://scholars.utp.edu.my/id/eprint/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf |