6th International Young Scientist Congress (IYSC-2020) and Workshop on Intellectual Property Rights. 10th International Science Congress (ISC-2020).  International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

A New Method to Mine Frequent Itemsets using Frequent Itemset Tree

Author Affiliations

  • 1Comp. Engg. Dept., LDRP, Gandhinagar, Gujarat, INDIA
  • 2Comp. Engg. Dept., LDRP, Gandhinagar, Gujarat, INDIA
  • 3Kalol, Gujarat, INDIA

Res. J. Computer & IT Sci., Volume 1, Issue (3), Pages 9-12, April,20 (2013)


The analysis of observational data sets to find unsuspected relationships and to summarize the data in novel ways that are both understandable and useful to the data owner. To find the association rules among the transactional dataset is the mainproblem of frequent itemset mining. Many techniques has been developed to increase the efficiency of mining frequentitemsets. In this paper, we denote a new method for generating frequent itemsets using frequent itemset tree (FI-tree). Alsowe describe the example of new method and its result analysis using wine dataset. Our method execution time is better compare to SaM method.


  1. 1. Raorane A.A., Kulkarni R.V. and Jitkar B.D., , AssociationRule Extracting Knowledge Using Market BasketAnalysis,, Res. J. Recent Sci.,1(2), 19-27 (2012)
  2. 2. Shrivastava Neeraj and Lodhi Singh Swati, , Overview ofNon-redundant Association Rule Mining,, Res. J. RecentSci., 1(2), 108-112 (2012)
  3. 3. Pramod S., Vyas O.P., , Survey on Frequent Item setMining Algorithms,, In Proc. International Journal ofComputer Applications, 1(15), 8691 (2010)
  4. 4. Agrawal R. and Srikant R., , Fast algorithms for miningassociation rules,, In Proc. Intl Conf. Very Large DataBases (VLDB), 487499 (1994)
  5. 5. Borgelt C., , Efficient Implementations of Apriori and Eclat,, In Proc. 1st IEEE ICDM Workshop on Frequent Item SetMining Implementations (2003)
  6. 6. Han J., Pei H. and Yin. Y., , Mining Frequent Patternswithout Candidate Generation,, In Proc. Conf. on theManagement of Data (2000)
  7. 7. Yves Bastide, Rafik Taouil, Nicolas Pasquier, GerdStumme, Lotfi Lakhal, , Mining Frequent Patterns withCounting Inference,, In Proc.ACM SIGKDD, 66-75 (2000)
  8. 8. Pei. J., Han. J., Lu. H., Nishio. S., Tang. S. and Yang. D.,, H-mine: Hyper-structure mining of frequent patterns inlarge databases,, In Proc. Intl Conf. Data Mining (2001)
  9. 9. Duemong F., Preechaveerakul L. and Vanichayobon S.,, FIAST: A Novel Algorithm for Mining Frequent Itemsets,, In Proc. Intl Conf. Future Computer and Communication,140-144 (2009)
  10. 10. Borgelt C., , SaM: Simple Algorithms for Frequent Item SetMining,, IFSA/EUSFLAT 2009 conference (2009)