Improving Efficiency of META Algorithm Using Record Reduction

Shweta Bidhan; Dr. Kanwal Garg

doi:10.24297/ijct.v8i1.6815

Authors

Shweta Bidhan DCSA, KUK, Kurukshetra
Dr. Kanwal Garg DCSA, KUK, Kurukshetra

DOI:

https://doi.org/10.24297/ijct.v8i1.6815

Keywords:

META algorithm, data mining, frequent pattern mining, Apriori algorithm

Abstract

Erasable Itemset Mining is the key approach of data mining in production planning. The erasable itemset mining is the process of finding erasable itemsets that satisfy the constraint i.e. user defined threshold. Efficient algorithm to mine erasable itemsets is extremely important in data mining. Since the META Algorithm was proposed to generate the erasable itemsets. In last few years there have been several methods to improve its performance. But they do not consider the time constraint. If database is large META takes too much time to scan the database. In this paper, Author purposed an Improved META (I-META) algorithm which reduces the scanning time by reduction of production records. It also reduces the redundant generation of sub-items during trimming the candidate itemsets, which can find directly the set of erasable itemsets and removing candidate having a subset that is not erasable.

Downloads

Download data is not yet available.

References

[1] Sanjeev Rao, Prianka Gupta, Â\Implimenting Improved Algorithm Over APRIORI Data Mining Association Rule Algorithm., In: proceeding of IJCST, VOL.3, Issue 1, Jan-March 2012.
[2] Deng, Z., Fang, G., Wang, Z., Xu, X., Â\Mining Erasable Itemsets.. In: 8th IEEE International Conference on Machine Learning and Cybernetics, pp. 67.73. IEEE Press, New York (2009).
[3] Sunita B.Aher, Lobo L.M.R.J.,.A Comparative Study of Association Rule Algorithms for Course Recommender System in E-learning., In: Proceeding of IJCA, Vol 39-No.1, February 2012.
[4] Jaishree Singh, Hari Ram, Dr. J.S. Sodhi, Â\Improving Efficiency of Apriori Algorithm Using Transaction Reduction., In: proceeding of IJSRP, Volume 3, Issue 1, January 2013. [
5] Badri Patel, Vijay K Chaudhary, Rajesneesh K Karan, YK Rana, Â\Optimization of Association Rule Mining Apriori Algorithm Using ACO., In: Proceeding of IJSCE, Volume-1, Issue-1, March 2011. [6] Shruti Aggarwal, Ranveer Kaur, Â\Comparative Study of Various Improved Versions of Apriori Algorithm., In: proceeding of IJETT, Volume 4, Issue 4,April-2013.
[7] K. Geetha, Sk. Mohiddin, Â\An Efficient Data Mining Technique for Generating Frequent Item Sets., In: Proceeding of IJARCSSE, volume 3, Issue 4, April 2013.
[8] Partibha Parikh Dinesh Waghela, Â\Comparative Study of Association Rule Mining Algorithms., In: Proceeding of UNIASCIT, Volume 2, Isuue 1, 2012.
[9] K. Vanitha, R. Santhi, Â\Evaluating the Performance of Association Rule Mining Algorithm., In: proceeding of JGRCS, Volume 2, Issue 6, June 2011.
[10] Rakesh Agrawal, T. Imieli.ski, A. Swami, "Mining association rules between sets of items in large databases". In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. pp. 207-216. Itemsets Gain {i3, i5, i7} {i5, i6, i7} 2500 1900 Calculate Gain of GC3
[11] Zhihong Deng and Xiaoran Xu, China, Â\Mining Top-rank-K Erasable Itemsets., in ICIC Express Letters, ICIC International @ 2011 ISSN 1881-803X, Volume 5, Number 1, January 2011.
[12] Zhihong Deng and Xiaoran Xu, Â\An efficient Approach for Mining Erasable Itemsets., in ADMA 2010, Part I, LNCS 6440, pp. 214.225, 2010.