International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

A Study of Various Projected Data based Pattern Mining Algorithms

Author Affiliations

  • 1LDRP Institute of Technology and Research, Gandhinagar, Gujarat, INDIA
  • 2Gandhinagar, Gujarat, INDIA
  • 3Alfa College of Engineering and Technology, Khatraj, Kalol, Gujarat, INDIA

Res. J. Material Sci., Volume 1, Issue (2), Pages 1-5, March,16 (2013)


The time required for generating frequent patterns plays an important role. Some algorithms are designed, considering only the time factor. Our study includes depth analysis of algorithms and discusses some problems of generating frequent pattern from the various algorithms. We have explored the unifying feature among the internal working of various mining algorithms. The work yields a detailed analysis of the algorithms to elucidate the performance with standard dataset like Mushroom etc. The comparative study of algorithms includes aspects like different support values, size of transactions.


  1. Raorane A.A., Kulkarni R.V. and Jitkar B.D., Association Rule – Extracting Knowledge Using Market Basket Analysis, Res. J. Recent Sci.,1(2), 19-27 (2012)
  2. Agrawal R. and Srikant.R, Fast algorithms for mining association rules, In Proc. Int’l Conf. Very Large Data Bases (VLDB), 487–499 (1994)
  3. Shrivastava Neeraj and Lodhi Singh Swati, Overview of Non-redundant Association Rule Mining, Res. J. Recent Sci.,1(2), 108-112 (2012)
  4. Agrawal R., Imielienski T. and Swami A., Mining Association Rules between Sets of Items in Large Databases, Proc. Conf. on Management of Data, 207–216 (1993)
  5. Pramod S., Vyas O.P., Survey on Frequent Item set Mining Algorithms, In Proc. International Journal of Computer Applications (0975 - 8887), 1(15), 86–91 (2010)
  6. Han J., Pei H. and Yin. Y., Mining Frequent Patterns without Candidate Generation, In Proc. Conf. on the Management of Data(2000)
  7. Pei. J., Han. J., Lu. H., Nishio. S. Tang. S. and Yang. D., H-mine: Hyper-structure mining of frequent patterns in large databases, In Proc. Int’l Conf. Data Mining(2001)
  8. Borgelt C., Keeping Things Simple: Finding Frequent Item Sets by Recursive Elimination, Proc. Workshop Open Software for Data Mining (OSDM’05 at KDD’05, Chicago, IL) , 66–70 (2005)
  9. Borgelt C., SaM., Simple Algorithms for Frequent Item Set Mining, IFSA/EUSFLAT 2009 conference (2009)
  10. Blake C.L. and Merz. C.J., UCI Repository of Machine Learning Databases, Dept. of Information and Computer Science, University of California at Irvine, CA, USA (1998)