Email this article 
Open Access
Subscription or Fee Access
A New parallel Prime Multi Algorithm for Association Rule Mining
Abstract
This paper describes a new parallel PrimeMulti algorithm for association rule mining. PrimeMulti algorithm addresses the shortcoming of previously proposed parallel buddy prima algorithm. New efficient algorithm for load balancing is also proposed in this paper. New algorithm divide transaction database equally according to the transaction length to the processors. In the Parallel PrimeMulti algorithm transaction database is represented by prime number. Less memory is requires as each transaction is replaced with the product of the equivalent prime numbers of their items. Parallel PrimeMulti algorithm works on top down as well as bottom up approach. The proposed algorithm for parallel frequent itemset mining and load balancing reduces the time and data complexity and divide transactional database efficiently for good load balancing among the processor
Keywords
References
S.N. Sivanandam, S. Sumathi, T. HarnsaPriya, K. Babu “Parallel Budy Prima – A Hybrid Parallel Frequent Itemset Mining Algorithm for Very Large Databases” Academic Open Internet Journal, vol 13, 2004.
E. H. Han, George Karypis, Vipin Kumar “Scalable Parallel Data Mining For Association Rules” IEEE Trans. Knowledge & Data Engg,vol. 12,no 3,may-june, 2000,pp. 337-352.
M. stonebreaker, R. Agrawal, U. Dayal, E.J. Neuhold, and A. Reuter,“DBMS Research at a Crossroads: The Vienna Update”, Proc. 19th very large data bases conf., 1993, pp. 688-692.
David W. Cheung, Sau. D. Lee & Yongqiao. Xiao “Effect of Data Skewness and Workload Balance in Parallel Data Mining”. IEEE Trans. Knowledge & Data Engg, vol. 14, no. 3, may-June, 2002.
Mohammed J.Zaki. “Parallel & Distributed Association Mining: A Survey.” IEEE Trans. Knowledge & Data Engg., oct-dec, 1999.
Sotiris Kotsiantis and Dimitris Kanellopoulos. “Association Rules Mining: A Recent Overview”. GESTS international Tran. On computer sc. And engg. vol. 32(1), 2006, pp. 71-82.
R. Agrawal, John C. Shafer “Parallel Mining of Association Rules”, IEEE Trans. Knowledge & Data Engg, vol. 8, no 6, dec. 1996.
A. Mueller. “Fast sequential and parallel algorithms for association rule mining: A comparison”. Technical Report No. CS-TR-3515 of CS Department, University of Maryland-College Park.
Burdick, D., Calimlim, M., Gehrke, J., "MAFIA :A Maximal Frequent Itemset Algorithm for Transactional databases", In Intl. Conf. on Data Engineering2001.
J. S. Park, M.-S. Chen and P. S.Yu. "Efficient Parallel Data Mining for Association rules", IBM Research Report, RC 20156, August 1995.
Jianwei Li, Ying Liu, Wei-keng Liao, Alok Choudhary, “Parallel Data Mining Algorithms for Association Rules and Clustering”, CRC Press, LLC,2006.
Eui-Hong Han, George Karypis, and Vipin Kumar,”Scalable paralle data mining for association rules”,IEEE Trans. on Knowledge and Data Engineering, 12(3):337–352, 2000.
Jianwei Li, Alok Choudhary, Nan Jiang, and Wei-keng Liao,”Mining frequent patterns by differential refinement of clustered bitmaps”, In Proc. of the SIAM Int’l Conf. on Data Mining, April 2006.
Iko Pramudiono and Masaru Kitsuregawa,”Tree structure based parallel frequent pattern mining on PC cluster”, In Proc. of the 14th Int’l Conf. on Database and Expert Systems Applications, pages 537–547, September 2003.
Seattle, “Parallel mining algorithms for generalized association rules with classification hierarchy”, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, Pages: 25 – 36, 1998.
Karam Gouda, Mosab Hassaan, Mohammed J. Zaki, "Prism: A Primal-Encoding Approach for Frequent Sequence Mining", icdm, pp.487-492, 2007 Seventh IEEE International Conference on Data Mining, 2007.
G. Praveen Kumar, Anirban Sarkar, Narayan C. Debnath, "A New Algorithm for Frequent Itemset Generation in Non-Binary Search Space," itng, pp.149-153, 2009 Sixth International Conference on Information Technology: New Generations, 2009.
Han J, Pei Jian, Runying Mao ” Mining Frequent Patterns without Candidate Generation: A Frequent Pattern Tree Approach” , Data Mining and Knowledge Discovery, Kluwer Academic Publishers,Netherland” 2004, pp 53-87.
Mohammad Nadimi-Shahraki, Norwati Mustapha, Md Nasir B Sulaiman, Ali B Mamat,” Maximal Frequent Itemsets Mining Using Database Encoding”, Proceedings of the World Congress on Engineering 2008 Vol I.
S. Bashir and A. R. Baig, "HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach," 9th International Multitopic Conference, IEEE INMIC 2005, pp. 1-7, 2005.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.