By Topic

Dynamic load balancing algorithms 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

4 Author(s)
Chuan-Xiang Ma ; Sch. of Comput. Sci., Huazhong Univ. of Sci. & Technol., China ; Qing-Hua Li ; Zhong Jian ; Hui Wang

Mining sequential patterns in large database is an important problem in data mining research. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient and scalable algorithms. In this paper, we present a new dynamic load algorithm based HPSPM (hash-based parallel algorithm for mining sequential patterns) on shared-nothing environment. Experiments on Dawning 300 cluster system show that this algorithm achieves good speedup and is substantially improved compared to HPSPM.

Published in:

Machine Learning and Cybernetics, 2003 International Conference on  (Volume:1 )

Date of Conference:

2-5 Nov. 2003