Copyright © 2006 Elsevier Inc. All rights reserved.
A parallel algorithm for mining multiple partial periodic patterns
Received 9 July 2005;
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
Unit(Pr[o,Pl])
- 4.2.2. Trapezoid distribution method
- 5. Experiments
- 6. Conclusions
- Acknowledgements
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)






