The week's pick
Reseach Article
Parallelizing Apriori on Dual Core using OpenMP
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 43 - Number 24 |
| Year of Publication: 2012 |
| Authors: Anuradha.t, Satya Pasad R, S. N. Tirumalarao |
10.5120/6440-8894
|
Anuradha.t, Satya Pasad R, S. N. Tirumalarao . Parallelizing Apriori on Dual Core using OpenMP. International Journal of Computer Applications. 43, 24 ( April 2012), 33-39. DOI=10.5120/6440-8894
Abstract
Accumulation of abundant data from different sources of the society but a little knowledge situation has lead to Knowledge Discovery from Databases or Data Mining. Data Mining techniques use the existing data and retrieve the useful knowledge from it which is not directly visible in the original data. As Data Mining algorithms deal with huge data, the primary concerns are how to store the data in the main memory at run time and how to improve the run time performance. Sequential algorithms cannot provide scalability, in terms of the data dimension, size, or runtime performance, for such large databases. Because the data sizes are increasing to a larger quantity, we must use high-performance parallel and distributed computing to get the advantage of more than one processor to handle these large quantities of data. The recent advancements in computer hardware for parallel processing is multi core or Chip Multiprocessor (CMP) systems. In this paper we present an efficient and easy technique for parallelization of apriori on dual-core using openMP wih perfect load balancing between the two cores. We present the performance evaluation of apriori for different support counts with different sized databases on dual core compared to sequential implementation.
References
- Jiawei Han and Micheline Kamber 2006 "Data Mining concepts and Techniques", 2nd edition Morgan Kaufmann Publishers, San Francisco.
- Fayyad, Usama,Gregory Piatetsky-Shapiro, and Padhraic Smyth 1996 "From Data Mining to Knowledge Discovery in Databases". AI Magazine Volume 17 Number 3(1996)
- Agrawal R, Imielinski T, Swami A 1993 "Mining association rules between sets of items in large databases" In: Proceedings of the 1993ACM-SIGMODinternational conference on management of data (SIGMOD'93), Washington, DC, pp 207–216
- Agrawal R, Srikant R 1994 "Fast algorithms for mining association rules" In: Proceedings of the 1994 international conference on very large data bases (VLDB'94), Santiago, Chile, pp 487–499
- R. Agrawal and J. Shafer 1996 "Parallel mining of association rules" IEEE Trans. Knowl. Data Eng. , vol. 8, pp. 962–969, Dec. 1996.
- M. J. Zaki 1997 "parallel and distributed association mining:A survey"IEEEConcur,vol. 7, pp. 14–25, Dec. 1997.
- Herb Sutter 2005 "The Free Lunch Is Over A Fundamental Turn Toward Concurrency in Software" This article appeared in Dr. Dobb's Journal, 30(3), March 2005.
- N. Karmakar 2011 "The New Trend in processor Making Multi-Core Architecture" www. scribd. com 15th may2011
- Jiawei Han, Hong Cheng,Dong Xin, Xifeng Yan 2007 "Frequent pattern mining: current status and future directions" In the Journal of Data Min Knowl Disc (2007) 15:55–86,Springer Science+Business Media, LLC 2007.
- Han J, Pei J, Yin Y 2000 " Mining frequent patterns without candidate generation" In: Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD'00),Dallas, TX, pp 1–12
- ZakiMJ 2000 "Scalable algorithms for association mining" IEEETransKnowl Data Eng 12:372–390
- Park JS, Chen MS, Yu PS 1995 "Efficient parallel mining for association rules" In: Proceeding of the 4th international conference on information and knowledge management, Baltimore, MD,pp 31–36
- Agrawal R, Shafer JC 1996 "Parallel mining of association rules: design, implementation, and experience" IEEE Trans Knowl Data Eng 8:962–969
- Cheung DW, Han J, Ng V, Fu A, Fu Y 1996 "A fast distributed algorithm for mining association rules" In: Proceeding of the 1996 international conference on parallel and distributed information systems, Miami Beach, FL, pp 31–44
- O. R Zaiane,M. El-Hajj, and P. Lu 2001 "Fast parallel association rule mining without candidacy generation" in Proc. ICDM, 2001, [Online]. Available: citeseer. ist. psu. edu/474 621. html, pp. 665–668.
- Wenbin Fang, Mian Lu, Xiangye Xiao, Bingsheng He, Qiong Luo 2009 "Frequent itemset mining on graphics processors" Proceedings of the Fifth International Workshop on Data Management onNew Hardware (DaMoN 2009) June 28, 2009, Providence, Rhode-Island
- . Shirish Tatikonda, Srinivasan Parthasarathy "Mining TreeStructured Data on Multicore Systems", VLDB '08, August 2430, 2008, Auckland, New Zealand
- Li Liu2, 1, Eric Li1, Yimin Zhang1, Zhizhong Tang 2007 "Optimization of Frequent Itemset Mining on Multiple-Core Processor" VLDB '07, September 23-28, 2007, Vienna, Austria.
- Amdahl, Gene 1967 "Validity of the Single Processor Approach to Achieving Large-Scale Computing Capabilities". AFIPS Conference Proceedings (30): 483–485.
- OpenMP Architecture , "OpenMP C and C++ ApplicationProgramInterface", Copyright © 1997-2002 OpenMP Architecture Review Board. http://www. openmp. org/
- Kent Milfeld 2011 "Introduction to Programming with OpenMP" September 12th 2011, TACC
- Ruud van der pas 2009 "An Overview of OpenMP" NTU Talk January 14 2009
- S N sivanandam, S Sumathi 2006 "DataMining concepts,tasks and Techniques" First print 2006 by Thomson Business Information Pvt. Ltd. , India.
Index Terms
Keywords