Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Intelligence Computation and Applications

ISICA 2009: Computational Intelligence and Intelligent Systems pp 427–432Cite as

An Improved Algorithm of Apriori

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 51))

Abstract

This paper puts forward a kind of improved algorithm after analyzing the classical Apriori algorithm. Through scanning database only once, all transactions are transformed into components of a two-dimensional array. The algorithm becomes more practical by introducing weight. Moreover, the unnecessary data are deleted in time, and the joining and pruning steps become simple. This, therefore, improves the efficiency of Apriori algorithm.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, USA, pp. 207–216. ACM Press, New York (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithm of mining association rules. In: Proceedings of the 20th International Conference on VLDB, Santigao, pp. 487–499 (1994)

    Google Scholar 

  3. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn., p. 4. China Machine Press, Beijing (2006)

    Google Scholar 

  4. Qian, X.-z., Kong, F.: Research of Apriori algorithm in mining association rules. Computer Engineering and Applications 44(17), 138–140 (2008)

    Google Scholar 

  5. Han, J., Fu, Y.: Discovery of Multiple-level Association Rules from Large Databases. In: 1995 International Conference Very Large Data Bases, Zurich (1995)

    Google Scholar 

  6. Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: 1995 International Conference Very Large Data Bases, Zurich (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The College of Mathematics and Statistics, Huazhong Normal University,  

    Binhua Liao

Authors
  1. Binhua Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, China University of Geosciences, 430074, Wu-Han, China

    Zhihua Cai

  2. State Key Laboratory of Novel Software Technology,, Nanjing University, P.O. Box, China

    Zhenhua Li

  3. Computation Center, Wuhan University, Wuhan, China

    Zhuo Kang

  4. School of Computer Science and Engineering, The University of Aizu, Japan

    Yong Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, B. (2009). An Improved Algorithm of Apriori. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2009. Communications in Computer and Information Science, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04962-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04962-0_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04961-3

  • Online ISBN: 978-3-642-04962-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation