We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

D-Apriori: An Algorithm to Incorporate Dynamism in Apriori Algorithm

by S. Bagga, N. Badal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Number 10
Year of Publication: 2014
Authors: S. Bagga, N. Badal
10.5120/15669-4231

S. Bagga, N. Badal . D-Apriori: An Algorithm to Incorporate Dynamism in Apriori Algorithm. International Journal of Computer Applications. 89, 10 ( March 2014), 24-28. DOI=10.5120/15669-4231

@article{ 10.5120/15669-4231,
author = { S. Bagga, N. Badal },
title = { D-Apriori: An Algorithm to Incorporate Dynamism in Apriori Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 89 },
number = { 10 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume89/number10/15669-4231/ },
doi = { 10.5120/15669-4231 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:08:53.905878+05:30
%A S. Bagga
%A N. Badal
%T D-Apriori: An Algorithm to Incorporate Dynamism in Apriori Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 10
%P 24-28
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Apriori algorithm mines the data from the large scale data warehouse using association rule mining. In this paper a new algorithm named as Dynamic Apriori (D-Apriori) algorithm is presented. The proposed D-Apriori algorithm incorporates the dynamism in classical Apriori for efficiently mining the frequent itemsets from a large scale database. With the help of experimental results, it is shown that the D-Apriori algorithm performs better than the existing Apriori algorithm with respect to execution time for the dynamic behavior of data itemset.

References
  1. Agrawal R. , Imielinski T. , and Swami A. , "Mining Associations between seta of items in Massive Databases". In proc. Of the ACM-SIGMOD 1993 int'l conf. on Management of Data, Washingtom D. c USA, 1993A, pp. 207-216.
  2. Agrawal R. , and Srikant R. , "Fast Algorithms for Mining Association Rules", In Proc. VLDB 1994, pp. 487-499.
  3. Badal N. , Bagga S. ," Implementation of Apriori Algorithm in MATLAB using Attribute Affinity Matrix", International Journal of Advanced Research in Computer Science and Software Engineering", Vol. 4, No. 1, Jan. 2013, pp. 10-15.
  4. Badal N. and Tripathi S. , "Frequent Data Itemset Mining Using VS_AprioriAlgorithms",in International Journal on Computer Science and Engineering Vol. 02, No. 04, 2010, pp. 1111-1118.
  5. Bentley J. L. , "Multidimensional binary search trees used for associative searching" in International journal of Communications of the ACM, Vol. 19, 1975, pp. 509–517.
  6. Brin S. , Motwani R. , Ullman J. D. , and S. Tsur, "Dynamic data itemset counting and implication rules for market basket data," SIGMOD Rec. , Vol. 26, No. 2, 1997, pp. 255–264.
  7. Chan P. and Stolfo S. , "Experiments in Multistrategy Learning by Meta-Learning", In Proc. of the second International conference on Information And Knowledge Management, 1993, pp. 314-323.
  8. Fredkin E. ,"Trie memory". Commun. ACM, Vol. 3, No. 9, 1960, pp. 490–499.
  9. Gopalan N. , Sivalselvan B. ," Data mining Techniques and Trends", PHI Learning private limited, New Delhi 2009.
  10. Han J. and Kamber M. ,"Data mining concepts and techniques", Elsevier, 2nd Edition. Chapter5.
  11. Han J. , Pei J. , and Yin Y. , "Mining frequent patterns without candidate generation," in SIGMOD Conference, 2000, pp. 1–12.
  12. Ian H. and Frank E. , "Data Mining: Practical machine learning tools and techniques", 2nd Edition, Morgan Kaufmann, San Francisco, 2005.
  13. Jerome H. Friedman. Data Mining and Statistics: What's the Connection? URL:http://stat. stanford. edu/~jhf/dm-stat. ps. Z
  14. Keleher P. , Cox A. L. , and Zwaenepoel W. , "Lazy Release Consistency for Software Distributed Shared Memory". In Proc. of the 19th Annual Int'l Symposium on Computer Architecture, 1992, pp. 13-21.
  15. Liu X. W. and He P. L. , "The research of improved association rules mining Apriori algorithm" Proceedings of
  16. 2004 International Conference on Machine Learning and
  17. Cybernetics, Vol. 3, No, 26-29 Aug. 2004, pp: 1577 – 1579.
Index Terms

Computer Science
Information Sciences

Keywords

Association rule mining frequent itemset frequent patterns Apriori D-Apriori

Powered by PhDFocusTM