IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 2    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 2,February 2012
An Efficient Parallel Approach for Frequent Itemset Mining of Incremental Data
Full Text(PDF, )  PP.175-179  
Mrs. Chetashri Bhadane, Dr. Ketan Shah, Mrs. Prajakta Vispute
Apriori , FUFP Algorithms, FP Tree Algorithm, Frequent Itemset, IMBT Structure, Incremental Data Mining, Parallel Data Mining,.
Frequent itemset mining is the essential step of data mining process. Further frequent itemset is a primary data obligatory for association rule mining. The Apriori and FP tree are conventional algorithms for mining frequent itemset and envisaging association rules based on it for knowledge discovery. The process of updating database continuously is known as incremental data mining. In real life, database updates recurrently where exactly conventional algorithms perform incompetently. If we could use the previous analysis to incrementally mine the frequent itemset from the updated database, the mining process would become more efficient and cost of mining process would be minimized. In this research, we propose a novel incremental mining scheme with a parallel approach for discovering frequent itemset. It uses a data structure called IMBT. It is a Incremental Mining Binary Tree which is used to record the itemset in an efficient way. Furthermore, our approach needs not to predetermine the minimum support threshold and scans the database only once.
[1] Chen, M. S., Han, J., & Yu, P. S. ―Data mining: An overview from a database perspective‖, IEEE Transactions on Knowledge and Data Engineering,‖ 8(6), 866–883,1996

[2] J. Han, J. Pei, Y. Yin, ―Mining Frequent Itemsets without Candidate Generation,‖ ACM SIGMOD International Conference on Management of Data, 2000.

[3] D. W. Cheung, J. Han, V. T. Ng, C. Y. Wong, ―Maintenance of discovered association rules in large databases: An incremental updating approach,‖ In The twelfth IEEE international conference on data engineering, pp. 106–114, 1996

[4] C. W. Lin, T. P. Hong, W. H. Lu, ―The Pre - FUFP algorithm for incremental mining,‖ Expert Systems with Applications, 2008

[5] C. I. Ezeife, Y. Su, ―Mining incremental association rules with generalized FP-tree,‖ In Proceedings of the 15th conference of the Canadian society, pp.147–160, 2002

[6] C. H. Yang and D. L. Yang, ‖IMBT-A Binary Tree for Efficient Support Counting of Incremental Data Mining,‖ 2009 International Conference on Computational Science & Engineering

[7] T. P. Hong, C. Y. Wang and Y. H. Tao, "A new incremental data mining algorithm using pre-large itemsets," Intelligent Data Analysis, Vol. 5, No. 2, 2001, pp. 111-129.Fghh

[8] Gosta Grahne, Member, IEEE, and Jianfei Zhu, Student Member, "Fast Algorithms for Frequent Itemset Mining Using FP-Trees," IEEE Transactions On Knowledge And Data Engineering, Vol. 17, No. 10, October 2005 1347.F

[9] Rakesh Agrawal and John C. Shafer, ―Parallel mining of association rules,‖ IEEE Trans. On Knowledge and Data Engineering, 8(6):962-969, December 1996.

[10] Jianwei Li, Ying Liu, Wei-keng Liao, Alok Choudhary, ―Parallel Data Mining Algorithms for Association Rule and Clustering,‖ 2006 by CRC Press, LLC

[11] Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach,‖ Data Mining and Knowledge Discovery, 8, 53–87, 2004

[12] Jian Pei, Jiawei Han, Hongjun Lu, Shojiro Nishio, Shiwei Tang, Dongqing Yang, ―H-Mine: Fast and space-preserving frequent pattern mining in large databases,‖ Data Mining and Knowledge Discovery, 8, 53-87, 2004

Untitled Page