[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Efficient Algorithm for the Extraction of Association Rules in Data Mining

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3981))

Included in the following conference series:

Abstract

The problem of data mining is to discover the pattern or trend in huge volume of data. The problem is similar to knowledge discovery in artificial intelligence. Here our goal is to discover rules that reflect the pattern in the data. These rules are called association rules. In [AS94] an algorithm is proposed to extract these association rules from the large/frequent itemsets computed by the apriori algorithm. In this paper we present a more efficient and output sensitive algorithm to compute these association rules given the lattice L of large itemsets. Our approach is based on pruning a lot of redundant association rules that have to be tested in the algorithm of [AS94] .We use a variation of the data structure for hashing using separate chaining in our algorithm. Our algorithm, is output sensitive in the sense that its time complexity will be proportional to the number of association rules that have to be generated and it is also optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the International Very Large Databases Conference, pp. 487–499 (1994)

    Google Scholar 

  2. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  3. Dunham, M.H.: Data Mining, Introductory and Advanced Topics. Pearson Education, Inc., London (2003)

    Google Scholar 

  4. Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw Hill Inc., New York (2003)

    MATH  Google Scholar 

  5. Silberschatz, A., Korth, H., Sudarshan, S.: Database System Concepts, 4th edn. McGraw Hill Inc., New York (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitra, P., Chaudhuri, C. (2006). Efficient Algorithm for the Extraction of Association Rules in Data Mining. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_1

Download citation

  • DOI: https://doi.org/10.1007/11751588_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34072-0

  • Online ISBN: 978-3-540-34074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics