By Topic

An improved parallel algorithm for 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

5 Author(s)
Chundong She ; Inst. of Software, Chinese Acad. of Sci., Beijing, China ; Jian Tang ; Lei Li ; Hongbing Wang
more authors

It is more and more important in data mining field to finding the frequent sequences in a large database. The paper briefly introduces the basic concept of frequent sequence mining and presents the data parallel formulation and task parallel formulation of tree-projection based algorithm. Moreover, the on-line LPT algorithm is used to successfully solve the problem of imbalance for the task parallel formulation. Our experiment shows that these algorithms are capable of achieving good speedups. However, the task parallel formulation is more scalable than the data parallel one.

Published in:

Mechatronics and Automation, 2005 IEEE International Conference  (Volume:4 )

Date of Conference: