Mining Sequential Patterns Using I-Prefixspan
Published in Zenodo (CERN European Organization for Nuclear Research) • Nov 20, 2007
Authors:,,
Dhany Saputra
Dayang Rohaya Awang Rambli
Oi Mean Foong
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 ...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!