ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Sciences
Volume 176, Issue 24, 15 December 2006, Pages 3591-3609
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (211 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ins.2006.02.010    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier Inc. All rights reserved.

A parallel algorithm for mining multiple partial periodic patterns

Guanling LeeCorresponding Author Contact Information, a, E-mail The Corresponding Author, Wenpo Yanga and Jia-Min Leea

aDepartment of Computer Science and Information Engineering, National Dong Hwa University, 1, Sec. 2, Da Hsueh Rd, Hualien 974, Taiwan, ROC

Received 9 July 2005; 
revised 27 January 2006; 
accepted 8 February 2006. 
Available online 10 March 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The mining of partial periodic patterns is an interesting type of data mining that is widely used in the analysis of markets, such as for stock management and sales management. However, the existence of huge data sets make the scalability of data-mining algorithms a very important objective, and in recent years parallel computing has been applied to general data-mining algorithms. This paper addresses the problem of mining multiple partial periodic patterns in a parallel computing environment. To reduce the cost of communication between the processors, our approach employs the independence property of prime numbers to classify partial periodic patterns into multiple independent sets. Moreover, a novel method of distributing mining tasks among the processors is proposed. A set of simulations is used to demonstrate the benefits of our approach.

Keywords: Data-mining; Parallel computing; Full periodic patterns; Partial periodic pattern

Article Outline

1. Introduction
2. Problem definition
3. Partial periodic patterns mining
3.1. Data preprocessing
3.2. Mining single periodic patterns
3.3. Mining multiple periodic patterns
3.3.1. Prime period mining
3.3.2. Composite period mining
3.4. Data postprocessing
4. Extension to a parallel computing environment
4.1. Reducing the communication cost
4.2. Workload balancing
4.2.1. Calculating midUnit(Pr[o,Pl])mid
4.2.2. Trapezoid distribution method
5. Experiments
6. Conclusions
Acknowledgements
References
















Information Sciences
Volume 176, Issue 24, 15 December 2006, Pages 3591-3609
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.