CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
Reseach Article

A Study on Milestones of Association Rule Mining Algorithms in Large Databases

by Saravanan Suba, Chistopher.t
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 3
Year of Publication: 2012
Authors: Saravanan Suba, Chistopher.t
10.5120/7167-9674

Saravanan Suba, Chistopher.t . A Study on Milestones of Association Rule Mining Algorithms in Large Databases. International Journal of Computer Applications. 47, 3 ( June 2012), 12-19. DOI=10.5120/7167-9674

@article{ 10.5120/7167-9674,
author = { Saravanan Suba, Chistopher.t },
title = { A Study on Milestones of Association Rule Mining Algorithms in Large Databases },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 3 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 12-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number3/7167-9674/ },
doi = { 10.5120/7167-9674 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:40:55.228733+05:30
%A Saravanan Suba
%A Chistopher.t
%T A Study on Milestones of Association Rule Mining Algorithms in Large Databases
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 3
%P 12-19
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining helps in doing automated extraction and generating predictive information from large amount of data. The association rule mining is one of the important area of research in Data mining. The Association rule mining identifies the useful associations or relationship among big set of data items. In this paper, we provide the important concepts of Association rule mining and existing algorithms and their effectiveness and drawbacks. The references provided in this paper covered the main theoretical issues and guiding the researcher in an interesting research direction that have yet to be discovered.

References
  1. G. K. Gupta, 2009 " Introduction to Data mining with Case Studies", PHI Learning private limited, New Delhi.
  2. N. P. Gopalan and B. Sivaselvan, 2009 " Data mining Techniques and Trends" PHI Learning private limited, New Delhi.
  3. S. Shankar and T. Purusothaman, 2009 "Utility Sentient Frequent Item set Mining and Association Rule Mining: A Literature survey and Comparative Study", International Journal of Soft Computing Applications ISSN: 1453-2277 Issue 4 , pp. 81-95.
  4. Ashok Savasere , Edward Omieinski and Shankant Navathe, 1995 "An Efficient Algorithm for Mining Association Rules in Large Databases", Proceedings of the 21st International Conference on Very Large Data Bases, pp. 432 – 444.
  5. R. Agrawal, T. Imielinski, and A. Swami, 1993 "Mining Association Rules Between Sets Of Items In Large Databases", In proceedings of the ACM SIGMOD International Conference on Management of data, pp. 207-216.
  6. M. J. Zaki and C. J. Hsiao, October 1999 "CHARM: An efficient algorithm for closed association rule mining", Technical Report 99-10, Computer Science Dept. , Rensselaer Polytechnic Institute.
  7. Sotiris Kotsiantis and Dimitris Kanellopoulos, 2006 "Association Rules Mining: A Recent Overview", GESTS International Transactions on Computer Science and Engineering, Vol. 32, No: 1, pp. 71-82.
  8. Anurag Choubey, Ravindra Patel,J. L. Rana, May 2011 "A Survey Of Efficient Algorithms And New Approach For Fast Discovery Of Frequent Item Set For Association Rule Mining", International Journal of Soft Computing and Engineering.
  9. Rakesh Agrawal and Ramakrishnan Srikant, Sep'1994 "Fast Algorithms For Mining Association Rules In Large Databases", In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pp 487-499, Santiago, Chile.
  10. M. Houtsma, and Arun Swami, 1995. "Set-Oriented Mining for Association Rules in Relational Databases", IEEE International Conference on Data Engineering, pp. 25–33.
  11. Park, J. S, Chen, M. S and Yu P. S, 1995 "An Effective Hash Based Algorithm For Mining Association Rules" , In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, M. J. Carey and D. A. Schneider, Eds. San Jose, California, pp. 175-186.
  12. Soo J, Chen, M. S, and Yu P. S, 1997 "Using a Hash-Based Method with Transaction Trimming and Database Scan Reduction for Mining Association Rules" , IEEE Transactions On Knowledge and Data Engineering, Vol. No. 5. pp. 813-825.
  13. En Tzu Wang and Arbee L. P. ChenData, " A Novel Hash-Based Approach For Mining Frequent Item-Sets Over Data Streams Requiring Less Memory Space", Data Mining and Knowledge Discovery, Volume 19, Number 1, pp 132-172.
  14. John D. Holt and Soon M. Chung," Mining of Association Rules in Text Databases Using Inverted Hashing and Pruning" Lecture Notes in Computer .
  15. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, 1997 "Dynamic Itemset Counting And Implication Rules For Market Basket Data", In Proceedings of the 1997 ACM SIGMOD, International Conference on Management of Data, volume 26(2) of SIGMOD Record, pp. 255–264. ACM Press.
  16. C. Hidber, 1999 "Online Association Rule Mining", In A. Delis, C. Faloutsos, and S. Ghandeharizadeh, editors, Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, volume 28(2) of SIGMOD Record, pp. 145–156, ACM Press.
  17. V. Umarani et al. , 2010 "A Study on Effective Mining of Association Rules from Huge Databases", International journal of computer science and research,Vol . 1,issue 1.
  18. Toivonen H, 1996 "Sampling large databases for association rules ", In VLDB Journal, pp. 134-145.
  19. Parthasarathy S, 2002 "Efficient Progressive Sampling for Association Rules", ICDM 2002, pp. 354-361.
  20. Chuang K, Chen M and Yang W, Jun 2005 "Progressive Sampling for Association Rules Based on Sampling Error Estimation", Lecture Notes in Computer Science, Volume 3518, pp. 505 – 515.
  21. Li Y and Gopalan R, Jan 2004 "Effective Sampling for Mining Association Rules, Lecture Notes in Computer Science", Volume 3339, pp. 391 – 401.
  22. V. Umarani and M. Punithavalli, 2009 " Developing a Novel and Effective Approach for Association Rule Mining Using Progressive Sampling" In the proceedings of 2nd International Conference on Computer and Electrical Engineering (ICCEE 2009), vol. 1, pp610-614.
  23. V. Umarani and M. Punithavalli , April 2010 "On Developing an Effectual Progressive Sampling Based Approach for Association Rule Discovery", In the proceedings of 2nd IEEE International Conference on Information and data Engineering (2nd IEEE ICIME 2010), Chengdu ,China .
  24. Savesere A, Omiecinski E, and Navathe S, 1995 "An Efficient Algorithm For Mining Association Rules In Large Databases", In Proceedings of 20th International Conference on VLDB.
  25. Cheung D, Han J, Ng V, Fu A and Fu, Y 1996, "A Fast Distributed Algorithm For Mining Association Rules", in Proceedings of 1996 International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, pp. 31-44.
  26. Cheung. D and Xaio. Y, 1998 "Effect Of Data Skewness In Parallel Mining Of Association Rules", Lecture Notes in Computer Science, Volume 1394, pages 48-60.
  27. Parthasarathy. S, Zaki, M. J. J and Ogihara M, 2001 "Parallel Data Mining For Association Rules On Shared-Memory Systems", Knowledge and Information Systems: An International Journal, 3(1), pp. 1-29.
  28. Tang P and Turkia M, 005 " Parallelizing frequent itemset mining with FP-trees. Technical Report titus. compsci. ualr. edu/~ptang/papers/par-fi. pdf", Department of Computer Science, University of Arkansas at Little Rock.
  29. Han,J And Pei. J, 2000 " Mining Frequent Patterns By Pattern Growth: Methodology And Implications", SIGKDD Explorations 2, 2, 14–20.
  30. Agarwal, R. Aggarwal, C and Prasad V, 2001 "A Tree Projection Algorithm For Generation Of Frequent Itemsets",Iternational journal of Parallel and Distributed Computing.
  31. Pei. J, Han. J, and Lakshmanan L. V. S, 2001 "Mining Frequent Itemsets With Convertible Constraints", In Proceedings of the 17th International Conference on Data Engineering (ICDE'01) Heidelberg, Germany , IEEE Computer Society Press, pp. 433 – 442.
  32. Liu. J, Pan. Y , Wang. K And Han. J, 2002 "Mining Frequent Item Sets By Opportunistic Projection", In Proceedings of the Knowledge Discovery in Databases. Edmonton, Canada, Vol. 31. ACM Press, pp. 97–102.
  33. Grahne G AND Zhu J, 2003 " Efficiently Using Prefix-Trees In Mining Frequent Itemsets", In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL. B. Goethals and M. J. Zaki, Eds. Vol. 90. IEEE Press.
  34. Arun K Pujari, 2009 "Data Mining Techniques", Universities Press(India).
  35. Wojciechowski. M and Zakrzewicz. M, 2002 "Dataset Filtering Techniques in Constraint-Based Frequent Pattern Mining", Lecture Notes in Computer Science, Volume 2447.
  36. Tien Dung Do, Siu Cheung Hui and Alvis Fong, 2003 "Mining Frequent Itemsets with Category- Based Constraints", Lecture Notes in Computer Science, Volume 2843, pp. 76 – 86.
  37. Han. J. and Kamber. M, 2000 "Data Mining Concepts and Techniques", Morgan Kaufmann publishers.
  38. Han. J, 1995. " Mining Knowledge At Multiple Concept Levels", In CIKM, 19-24.
  39. Han. J and Fu. Y, 1995 " Discovery Of Multiple-Level Association Rules From Large Databases", In Proc. of 1995 International Conference. on Very Large Data Bases (VLDB'95), ZAurich, Switzerland, September 1995, pp. 420-431.
  40. Psaila G and Lanzi P. L, 2000 " Hierarchy-based mining of association rules in data warehouses", In Proceedings of the 2000 ACM symposium on Applied computing 2000 , ACM Press, pp. 307-312.
  41. Yinbo WAN, Yong LIANG and Liya DING, 2009 "Mining Multi-level Association Rules From Primitive Frequent Item-sets", Journal of Macau University of Science and Tech-nology, June 30 , Vol 3 No 1.
  42. Brin S, Motwani R and Silverstein C, May 1997 "Beyond Market Baskets: Generalizing Association Rules to Correlations", In Proceedings of ACM SIGMOD Conference, pp. 265-276.
  43. Savasere A, Omiecinski E, and Navathe S, 1998 "Mining For Strong Negative Associations In A Large Database Of Customer Transactions " , In Proceedings of ICDE, pp. 494–502.
  44. Yuan X, Buckles B, Yuan Z and Zhang J, 2002 "Mining Negative Association Rules. ", In Proceedings, Of ISCC , pp. 623–629.
  45. Wu X, Zhang C and Zhang S, 2002 " Mining Both Positive And Negative Association Rules", In Proceedings of ICML" pp. 658– 665.
  46. Wu X, Zhang C and Zhang S, 2004 " Efficient Mining of Both Positive and Negative Association Rules", ACM Transactions on Information Systems, Vol. 22, No. 3, pp. 381– 405.
  47. M. L. Antonie and O. R. Zaane, 2004 "Mining Positive and Negative Association Rules: an Approach for Confined Rules", Proceedings of International Conference on Principles and Practice of Knowledge Discovery in Databases, pp 27–38.
  48. Chris Cornelis, Peng Yan, Xing Zhang, and Guoqing Chen, 2006 " Mining Positive and Negative Association Rules from Large Databases", IEEE conference 2006.
  49. B. Ramasubbareddy, Dr. A. Govardhan, Dr. A. Ramamohanreddy, Nov 2010 " An Approach for Mining Positive and Negative Association Rules ", International Journal of Recent Trends in Engineering and Technology, Vol. 4,No. 1.
  50. Das. A, Ng, W. K and Woon Y. K, 2001. "Rapid Association Rule Mining", In Proceedings of the tenth international conference on Information and knowledge management, ACM Press, 474-481.
  51. M. Dunham, 2003 "D ata Mining Introductory and Advanced Topics", pp. 185-186, Section 6. 7. 2. Pearson Education.
  52. Bay Vo1 and Bac Le, Sep'2009 "Fast Algorithm for Mining Generalized Association Rules", International Journal of Database Theory and Application, Vol. 2, No. 3.
  53. JR. Srikant and R. Agrawal, 1995 "Mining Generalized Association rules", In Proceedings of the 21'st International Conference on Very Large Databases, pp. 407-419, Zurich, Switzerland.
  54. Ashish Mangalampalli and Vikram Pudi, 2011 "Fuzzy Associative Rule-based Approach for Pattern Mining and Identification and Pattern-based classification", WWW 2011–Ph. D. Symposium .
  55. Ogunde A O, Folorunso O, Sodiya A S Oguntuase J A, and Ogunleye G O, 2011 " Improved Cost Models For Agent Based Association Rule Mining In Distributed Databases", Anale. Seria Informatica. Vol. IX.
  56. Christopher. T, 2010 " Character Based Weighted Support Threshold Algorithm Using Multi criteria Decision Making Technique ", International Journal On Computer science And Engineering Vol. 02, No. 04, 2010, pp. 965-971.
  57. A. Tiwari , R. K. Gupta and D. P. Agrawal , 2010 "A Survey On Frequent Pattern Mining:Current Status And Challenging Issues" Information Technology Journal 9(7) , pp. 1278-1293.
  58. B. Lent, A. Swami,and J. Wisdom, " Clustering association rules", In the proceeding of 13th International Conference on Data Engineering, pp. 220.
  59. Rajendra K. Gupta and Dev Prakash Agarwal , "Improving the performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions dynamically", Asian Journal of Information Management, pp. 7-17. 2009 Academic Journals Inc.
  60. Pi Dechang and Qin Xiaolin," A New Fuzzy Clustering Algorithm on Association Rules for Knowledge Management", Information Technology Journal. pp. 119-124, 2008. Asian Network for Scientific Information.
  61. Gyorodi C,Gyorodi R ,Coffey T,Holban S,2003 "Mining Association rules using Dynamic FP-trees, Proceedings of Irish signals and systems conference, Limerick, Ireland, 76-81.
  62. Claudia Marinica and Fabrice Guillet, June 2010, " Knowledge–Based Interactive Postmining of Association Rules Using Ontologies" IEEE Transactions On Knowledge And Data Engineering Vol. 22 NO. 6
Index Terms

Computer Science
Information Sciences

Keywords

Data Mining Association Rule Mining Apriori Fp-growth Frequent Item Sets