The week's pick
Random Articles
Reseach Article
An FP Tree based Approach for Extracting Frequent Pattern from Large Database by Applying Parallel and Partition Projection
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 114 - Number 18 |
| Year of Publication: 2015 |
| Authors: Jagrati Malviya, Anju Singh, Divakar Singh |
10.5120/20075-2077
|
Jagrati Malviya, Anju Singh, Divakar Singh . An FP Tree based Approach for Extracting Frequent Pattern from Large Database by Applying Parallel and Partition Projection. International Journal of Computer Applications. 114, 18 ( March 2015), 1-5. DOI=10.5120/20075-2077
Abstract
There are lots of data mining tasks such as association rule, clustering, classification, regression and others. Among these tasks association rule mining is most prominent. One of the most popular approaches to find frequent item set in a given transactional dataset is Association rule mining. Frequent pattern mining is one of the most important tasks for discovering useful meaningful patterns from large collection of data. The FP Growth algorithm is currently one of the fastest approaches to frequent item set mining. This paper proposed an efficient and improved FP Tree algorithm which used a projection method to reduce the database scan and save the execution time. The advantage of PFP Tree is that it takes less memory and time in association mining. Experimental result showed that the improved PFP Tree algorithm performs faster than FP growth Tree algorithm and partition projection algorithm. It is more efficient and scalable in the case of large volume of data. The effectiveness of the method has been justified over a sample our one super market database.
References
- R. Agrawal and R. Srikant. ," Fast algorithms for mining association rules", VLDB, 1994, pp 487-499.
- Li Haoyuan, Yi Wang, Zhang Dong, Zhang Ming, Chang Edward, "PFP: Parallel FP Growth for query Recommendation".
- Jiawei Han, M. Kamber, "Data Mining-Concepts and Techniques", Sam Francisco 2009, Morgan Kanufmann Publishers.
- R Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases", In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, May 1993, Washington, D. C. , pp 207–21.
- Jiawei Han, Jian Pei, Runying Mao," Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach", Data Mining and Knowledge Discovery, April 2001, Kluwer Academic Publishers, Manufactured in The Netherlands.
- Lijuan Zhou , Xiang Wang, "Research of the FP Growth algorithm based on Cloud Environment" , Journal of Software, March 2014,volume 9, N0. 3.
- J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen , U. Dayal , and Hsu, M. -C. FreeSpan, "Frequent pattern-projected sequential pattern mining", ACM SIGKDD, 2010.
- J. Han, J. Pei, and Y. Yin , "Mining Frequent Patterns without Candidate Generation", SIGMOD 2000, pp 1-12.
- H. Huang , X. W , and R. Relue , "Association Analysis with One Scan of Databases", Proceedings of the IEEE International Conference on Data Mining, 2002.
- R. Agrawal, C. C. Aggarwal , and V. V. V. Prasad," A Tree Projection Algorithm For Generation of Frequent Itemsets", Journal on Parallel and Distributed Computing[(Special Issue on High Performance Data mining)], 2010.
- Jagrati Malviya , Anju Singh , " A comparative study of various database techniques for frequent pattern generation", ACSIT Nov 2014.
- Vikram Garg , Anju Singh , Divakar Singh , "A Hybrid Algorithm for Association Rule Hiding using Representative Rule", International Journal of Computer Applications (IJCA )2014.
- C. C. Agarwal, "An Introduction to uncertain data algorithm and applications", Advances in Database Systems, 2009, 35; pp 1–8.
- Rashmi Shikhariya, Nitin Shukla , "An improved association rule mining with FP Tree using positive and negative integration",Journal of global research in computer science (JGRCS), Oct 2012. Volume 3, No. 10.
Index Terms
Keywords