Enhancing the Performance in Generating Association Rules using Singleton Apriori

Full Text (PDF, 566KB), PP.58-64

Views: 0 Downloads: 0

Author(s)

K.Mani 1,* R.Akila 1

1. Department of Computer Science, Nehru Memorial College, Puthanampatti, Tiruchirappalli, 621 007, Tamilnadu, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2017.01.07

Received: 11 Feb. 2016 / Revised: 5 Jun. 2016 / Accepted: 12 Sep. 2016 / Published: 8 Jan. 2017

Index Terms

Apriori, Candidate itemsets, Frequent itemsets, Minimum Support, Minimum Confidence, Single Scan

Abstract

Association rule mining aims to determine the relations among sets of items in transaction database and data repositories. It generates informative patterns from large databases. Apriori algorithm is a very popular algorithm in data mining for defining the relationships among itemsets. It generates 1, 2, 3,…, n-item candidate sets. Besides, it performs many scans on transactions to find the frequencies of itemsets which determine 1, 2, 3,…, n-item frequent sets. This paper aims to eradicate the generation of candidate itemsets so as to minimize the processing time, memory and the number of scans on the database. Since only those itemsets which occur in a transaction play a vital role in determining frequent itemset, the methodology that is proposed in this paper is extracting only single itemsets from each transaction, then 2,3,..., n itemsets are generated from them and their corresponding frequencies are also calculated. Further, each transaction is scanned only once and no candidate itemsets is generated both resulting in minimizing the memory space for storing the scanned itemsets and minimizing the processing time too. Based on the generated itemsets, association rules are generated using minimum support and confidence.

Cite This Paper

K.Mani, R.Akila, "Enhancing the Performance in Generating Association Rules using Singleton Apriori", International Journal of Information Technology and Computer Science(IJITCS), Vol.9, No.1, pp.58-64, 2017. DOI:10.5815/ijitcs.2017.01.07

Reference

[1]Jiawei Han and Michelin Kamber,“Data Mining Concepts and Techniques”, 2nd Ed., Morgan Kaufmann Publisher, 2006.
[2]Peng Peng, Qianli Ma and Chaoxiong Li ,”The Research and Implementation of Data Mining Component Library System”, College of Computer Science and Engineering, South China University of Technology, Guangzhou, PR China.
[3]Caixian Chen, Huijian Han and Zheng Liu,”KNN question classification method based on Apriori algorithm”, School of Computer Science and Technology, Shandong University of Finance and Economics, Jinan, Shandong, China, March 2014.
[4]Arti Rathod, Mr. Ajaysingh Dhabariya and Chintan Thacker,”A Survey on Association Rule Mining for Market Basket Analysis and Apriori Algorithm”, International Journal of Research in Advent Technology, Vol.2, March 2014.
[5]Zhi Liu, Tianhong Sun and Guoming Sang, “An Algorithm of Association Rules Mining in Large Databases Based on Sampling“, International Journal of Database Theory and Application, Vol.6, 2013.
[6]Sadegh Bafandeh Imandoust and Mohammad Bolandraftar,” Application of K-Nearest Neighbor (KNN) Approach for Predicting Economic Events: Theoretical Background”, Journal of Engineering Research and Application,Vol. 3, Issue 5, Sep-Oct 2013.
[7]Harpreet Singh and Renu Dhir, ”A New Efficient Matrix Based Frequent Itemset Mining Algorithm with Tags”, International Journal of Future Computer and Communication, Vol. 2, No. 4, August 2013.
[8]Sunitha Vanamala, L.Padma sree and S.Durga Bhavani,”Efficient Rare Association Rule Mining Algorithm”, International Journal of Engineering Research and Applications, Vol. 3, May-Jun 2013.
[9]Jogi.Suresh and T.Ramanjaneyulu, ”Mining Frequent Itemsets Using Apriori Algorithm“, International Journal of Computer Trends and Technology, Vol. 4, April 2013.
[10]P. Ajith, B. Tejaswi and M.S.S.Sai,”Rule Mining Framework for Students Performance Evaluation”, International Journal of Soft Computing and Engineering, Vol. 2, January 2013.
[11]Ziauddin, Shahid Kammal, Khaiuz Zaman Khan and Muhammad Ijaz Khan, ”Research on Association Rule Mining “,Advances in Computational Mathematics and its Applications ACMA, Vol. 2, 2012.
[12]Badri Patel, Vijay K Chaudhari, Rajneesh K Karan and YK Rana, ”Optimization of Association Rule Mining Apriori Algorithm Using ACO”, International Journal of Soft Computing and Engineering, Vol. 1, March 2011.
[13]Deepa S. Deshpande,”A Novel Approach for Association Rule Mining using Pattern Generation”, International Journal of Information Technology and Computer Science, Vol. 6, No. 11, pp.59-65, October 2014, doi: 10.5815/ijitcs.2014.11.09.
[14]Darshan M. Tank, “Improved Apriori Algorithm for Mining Association Rules”, International Journal of Information Technology and Computer Science, Vol. 6, pp.15-23, No. 7,June 2014, doi:10.5815/ijitcs.2014.07.03.
[15]Padam Gulwani, “Association Rule Hiding by Positions Swapping of Support and Confidence”, International Journal of Information Technology and Computer Science, Vol. 4, No. 4, pp.54-61, April 2012.
[16]Sonia Setia and Dr. Jyoti, “Multi-Level Association Rule Mining: A Review “, International Journal of Computer Trends and Technology, Vol. 6, Dec 2013.
[17]Thabet Slimani and Amor Lazzez,”Efficient Analysis of Pattern and Association Rule Mining Approaches”, International Journal of Information Technology and Computer Science, Vol. 03, pp. 70-81, 2014, doi:10.5815/ijitcs.2014.03.09.
[18]Manish Saggar, Ashish Kumar and Agrawal Abhimanyu Lad, Optimization of Association Rule Mining using Improved Genetic Algorithms, IEEE International Conference on Systems, Man and Cybernetics, 2004.