An Adjacency Matrix Based Apriori Algorithm for Frequent Itemsets Mining

Authors(3) :-Mahendra N. Patel, Suresh B Patel, Dr. S. M. Shah

Finding frequent itemsets is a most researched field in data mining. Currently, the finding of frequent itemsets problem’s solution has been proposed by many researchers. The Apriori algorithm is the basic algorithm for frequent itemsets mining. In Apriori algorithm, there are main two issues: scanning the database multiple times and generating a large number of candidate sets. In recent years several improved apriori algorithms have been defined and evaluated to improve efficiency. Our main goal is to define a new optimized algorithm and to compare its performance with the existing algorithms. The main focus of our work is to propose a new optimized algorithm and to compare its performance with the state of the art methods. In proposed work, adjacency matrix will be employed in order to improve the operating efficiency and eliminate the candidate sets. In a proposed system not require the pruning step. Performance of the proposed method will be evaluated on existing datasets. A secondary data set is used to find frequent itemsets with using our proposed algorithm and existing algorithm. The effect of our proposed algorithm is presented.

Authors and Affiliations

Mahendra N. Patel
PG Scholar, Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India
Suresh B Patel
PG Scholar, Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India
Dr. S. M. Shah
Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India

Apriori, Data Mining, Frequent Itemsets Mining (FIM), Adjacency Matrix, FI-generator

  1. Agrawal and Rakesh,"Fast Algorithms for Mining Association Rules in Large Databases",Proceedings of the ACM SIGMOD International Conference Management of Data,Washington,Vol. 22,Issue 2,pp.207-216,1993.
  2. Jiawei Han and Micheline Kamber,Book:"Data Mining,Concept and Techniques".
  3. G. Piatetski-Shapiro,"Discovery,Analysis,and
  4. Presentation of Strong Rules. In Knowledge Discovery in Databases",Piatetski-Shapiro,G.,editor,AAAI/MIT Press,pp. 229-248,1991.
  5. Ye,Yanbin,and Chia-Chu Chiang. "A parallel apriori algorithm for frequent itemsets mining." In Software Engineering Research,Management and Applications",Fourth International Conference on,pp. 87-94. IEEE,2006.
  6. R. Agrawal and R. Srikant,"Fast Algorithms for Mining
  7. Association Rules," Proceedings of the 20th International Conference on Very Large Data Bases,pp. 487-499,1994.
  8. Archana Singh and Jyoti Agarwal,"Proposed algorithm for frequent itemset generation",Seventh IEEE International Conference on Contemporary Computing,pp. 160-165,2014.
  9. DixitaTandel,Neha Soni,"Survey on Improvement of Apriori Algorithm",International Journal of Innovative Research in Computer and Communication Engineering Vol. 5,Issue 1,ISSN 2320-9801, January 2017.
  10. X. Luo and W. Wang,"Improved AlgorithmsResearch for Association Rule Based on Matrix," International Conference on intelligent computing and Cognitive Informatics,pp. 415–419,Jun. 2010.
  11. Jiaoling Du,Xiangli Zhang,Hongmei Zhang and Lei Chen,"Research and Improvement of Apriori Algorithm",IEEE Sixth International Conference on Science and Technology,pp.117-121,2016.
  12. Jaishree Singh, Hari Ram, Dr. J.S. Sodhi," Improving Efficiency of Apriori Algorithm Using Transaction Reduction",International Journal of Scientific and Research Publications Volume 3,Issue 1,ISSN 2250-3153,January 2013
  13. Jiao Y.,"Research of an Improved Apriori Algorithm in Data Mining Association Rules",International Journal of Computer & Communication Engineering,2(1)),pp.25-27,2013.
  14. Singh,Archana,Jyoti Agarwal,and Ajay Rana,"Performance measure of similis and FP-growth algorithm",International Journal of Computer Applications,2013.
  15. Han,Jiawei,Jian Pei,and Yiwen Yin,"Mining frequent patterns without candidate generation.",ACM sigmoid record,Vol. 29. No. 2,2000.

Publication Details

Published in : Volume 4 | Issue 2 | January-February 2018
Date of Publication : 2018-01-20
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 158-162
Manuscript Number : IJSRSET184228
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Mahendra N. Patel, Suresh B Patel, Dr. S. M. Shah, " An Adjacency Matrix Based Apriori Algorithm for Frequent Itemsets Mining, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 2, pp.158-162, January-February-2018.
Journal URL : http://ijsrset.com/IJSRSET184228

Article Preview

Follow Us

Contact Us