By Topic

A Bit-Encoding Approach for Frequent Sequence Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhaoliang Zhu ; State Key Lab. of Software Dev. Environ., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Xuefeng Mu ; Gang Zhou

Sequential pattern mining is an important data mining problem with broad applications. And the classic algorithm for this problem is PrefixSpan, which is a projection-based, sequential pattern-growth approach. But it must scan projected database once in order to find a local frequent item, it may cost much time when the database is large. In this paper, we propose an encoding-based, sequential pattern-growth approach for efficient mining of sequential patterns, PSBE (PrefixSpan with Bit-Encoding), which can find local frequent item with little cost. In this approach, we encode the database with 0,1 bits, build encoded database, and use the framework of PrefixSpan to find out sequential patterns. We can improve the PrefixSpan by the property of encoding. Our experiment shows that PSBE outperforms the PrefixSpan algorithm.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009