skip to main content
10.1145/2905055.2905238acmotherconferencesArticle/Chapter ViewAbstractPublication PagesictcsConference Proceedingsconference-collections
research-article

Analysis of Association rule in Data Mining

Published:04 March 2016Publication History

ABSTRACT

Mining the information from large databases has been predictable by many researchers as a main study in diverse system. Researchers in many fields have given away huge interest in data mining. In recent years, Association rule Discovery has become a central topic in Data Mining. Association rule analysis is the approach of generating association rules that take place commonly in a given transaction set. This rule is used to discover relations among the attribute of huge data set based on the support value. This paper provides a survey of the association rule data mining techniques developed recently and analyses the benefits and drawbacks thereof.

References

  1. Agrawal R., Imielinski T., and Swami A. 1993. Mining association rules between set of items in large databases. In Proceedings of ACM SIGMOD. pages 207--216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Wu, X., Kumar, V., Quinlan, J. R., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., Zhou, Z.-H., Steinbach, M., Hand, D. J., & Steinberg, D. 2007. Top 10 algorithms in data mining, Knowledge and Information Systems(Springer). Volume 14, No 1, pages 1--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Nandagopal S., Arunachalam V P., Karthik, S. 2012. Mining of datasets with an enhanced Apriori Algorithm. Journal of Computer Science. Volume 8, No 4, pages 599--605.Google ScholarGoogle Scholar
  4. Sharma S and Singhal V. 2012. A systematic approach and algorithm for frequent data itemsets. Journal of Global Research in Computer Science. Volume 3, No 11, pages 41--43.Google ScholarGoogle Scholar
  5. Vincent S. Tseng, Bai-En Shie, Cheng-Wei Wu and Philip S. Yu. 2013. Efficient Algorithms for mining high utility item sets from transactional databases. IEEE transactions on knowledge and data engineering. Volume 25, No 8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Rana M and Mann P S. 2013. Analysis of MFGA to Extract Interesting Rules. International Journal of Computer Applications. Volume 84, No 3, pages 15--21.Google ScholarGoogle ScholarCross RefCross Ref
  7. J.Han and M.Kamber. Data Mining Concepts and Techniques. Morgan Kauffman Publishers. San Francisco. USA 2001, ISBN 1558604898 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Selvi K., Sadhasivam C. and Angamuthu T. 2011. Mining rare item set with automated support threshold. Journal of Computer science. Volume 7, No 3.Google ScholarGoogle Scholar
  9. Azadeh Soltani and Akbarzadeh M R. 2014. Confabulation --inspired association rule mining for rare and frequent item sets. IEEE Transactions on neural networks and learning systems. Volume 25, No 11.Google ScholarGoogle Scholar
  10. J. Han, J. Pei, Y. Yin and ldquo. 2000. Mining Frequent Patterns without Candidate Generation. Proc. ACM-SIGMOD International Conf. Management of Data. pages 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Han, Y. Fu and ldquo. 1995. Discovery of Multiple-Level Association Rules from Large Databases. Proc. 21th International Conf. Very Large Data Bases. pages 420--431. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Analysis of Association rule in Data Mining

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies
      March 2016
      843 pages
      ISBN:9781450339629
      DOI:10.1145/2905055

      Copyright © 2016 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 March 2016

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate97of270submissions,36%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader