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...

Full description

Bibliographic Details
Main Authors:	Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean
Format:	Citation Index Journal
Published:	World Academy of Science Engineering & Technology (WASET) 2008
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://eprints.utp.edu.my/1159/ http://eprints.utp.edu.my/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf

id	utp-1159
recordtype	eprints
spelling	utp-11592017-01-19T08:26:17Z 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 http://eprints.utp.edu.my/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] http://eprints.utp.edu.my/1159/
institution	Universiti Teknologi Petronas Universiti Teknologi Petronas
repository_type	Digital Repository
institution_category	Local University
building	UTP Repository
collection	Online Access
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Saputra , Dhany Dayang R.A. Rambli, Foong, Oi Mean Mining Sequential Patterns using I-PrefixSpan
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.
format	Citation Index Journal
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
title	Mining Sequential Patterns using I-PrefixSpan
title_short	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_sort	mining sequential patterns using i-prefixspan
publisher	World Academy of Science Engineering & Technology (WASET)
publishDate	2008
url	http://eprints.utp.edu.my/1159/ http://eprints.utp.edu.my/1159/1/IJCSE_Spring_2008_Journal_Paper.pdf
first_indexed	2018-09-08T10:05:10Z
last_indexed	2018-09-08T10:05:10Z
_version_	1611033330812190720

Mining Sequential Patterns using I-PrefixSpan

Similar Items