A Study of DATA Mining Algorithms

Authors

  • Satya Sree Department of CSE, VNITSW, Guntur, AP, India
  • Hema priya Department of CSE, VNITSW, Guntur, AP, India

DOI:

https://doi.org/10.37591/joadms.v2i1.368

Keywords:

Itemset, H-struct, FP-growth

Abstract

The time needed for generating frequent patterns plays a vital role. Some algorithms are designed, considering solely the time issue. Our study includes depth analysis of algorithms and discusses some problems of generating frequent pattern from the varied algorithms. We have explored the unifying feature among the inner operating of assorted mining algorithms. The work yields a close analysis of the algorithms to elucidate the performance with normal dataset like Mushroom etc. The comparative study of algorithms includes aspects like; totally different support values and size of transactions.

 

Cite this Article
Satya Sree, Hema Priya. A Study of DATA Mining Algorithms. Journal of Advanced Database Management & Systems. 2015; 2(1): 22–26p.

References

Han J., Pei H., Yin. Y., Mining Frequent Patterns without Candidate Generation, In Proc. Conf. on the Management of Data. Dallas, TX, 2000.

Raorane A.A., Kulkarni R.V., Jitkar B.D., Association Rule – Extracting Knowledge Using Market Basket Analysis, Res. J. Recent Sci. 2012; 1(2): 19–27p.

Pei. J., Han. J., Lu. H., et al. H-mine: Hyper-structure Mining of Frequent Patterns in Large Databases, In Proc. Intl Conf. Data Mining. 2001.

Agrawal R., Imielienski T., Swami A., Mining Association Rules between Sets of Items in Large Databases, Proc. Conf. on Management of Data, Washington, DC, 1993, 207–216p.

Pramod S., Vyas O.P., Survey on Frequent Item set Mining Algorithms, In Proc. Int J Comp Appl. 2010; (0975–8887), 1(15): 86–91p.

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), 2005, 66–70p.

Agrawal R., Srikant. R, Fast Algorithms for Mining Association Rules, In Proc. Int’l Conf. Very Large Data Bases (VLDB), Santiago, Chile, 1994, 487–499p.

Borgelt C., SaM., Simple Algorithms for Frequent Item Set Mining, IFSA/EUSFLAT 2009 conference, 2009.

Shrivastava Neeraj, Lodhi Singh Swati, Overview of Non-redundant Association Rule Mining, Res. J. Recent Sci. 2012; 1(2): 108–112p.

Downloads

Published

2015-04-21

Issue

Vol. 2 No. 1 (2015)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.