Skip to main content

An Algorithm for Mining Association Rules Based on the Database Characteristic Matrix

  • Conference paper
  • First Online:
Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation
  • 1242 Accesses

Abstract

This paper proposes a new algorithm for mining association rules. In order to calculate itemsets support, this paper puts forward the concept of database characteristic matrix and characteristic vector, and emerges an algorithm for mining association rules based on the characteristic matrix. This algorithm needs to traverse the database one time only, and the database operation has been reduced greatly. Based on the characteristic vector inner product, an itemset support can be obtained and the efficiency of the algorithm has been improved.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 189.00
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Mannila H, Toivonen H, Verkamo A (1994) Efficient algorithm for discovering association rules. In: AAAI Workshop on knowledge discovery in databases, pp 181–192

    Google Scholar 

  2. Srikant R, Agrawal R (1995) Mining generalized association rulers. In: Proceedings of the 21th international conference on very large database, pp 407–419

    Google Scholar 

  3. Toivonen H, Klemettinen M, Ronkaine P et al (1995) Pruning and grouping discovery association rules. In: Mlnet workshop on statistics, machine learning and discovery in database, Herakloon, Crete, Greece

    Google Scholar 

  4. Agrawal R, Srikant R (1994) Fast algorithms for mining. Association rules in large databases. In: Proceedings 20th international conference very large databases, pp 478–499

    Google Scholar 

  5. Spark J (ed) (1995) An effective hash based algorithm for mining association rules. In: Proceedings ACM SIGMOD, pp 175–186

    Google Scholar 

  6. Toivonen H (1996) Sampling large databases for association rules. In: Proceedings of the 22th international conference on Very Large Databases (VLDB), Bombay, india. Morgan Kaufmann, pp 134–145

    Google Scholar 

  7. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD conference on management of data, pp 207–216

    Google Scholar 

  8. Wang NB (2000) Database management system. Publishing House of electronics industry, Beijing, pp 435–439

    Google Scholar 

  9. Jiawei H (2001) Micheline, translated by Meng xiao feng. Data mining-concepts and techniques. Machinery Industry Press, p 8

    Google Scholar 

  10. Zhong Zhi S (2002) Knowledge discovery. Tsinghua University press, p 1

    Google Scholar 

  11. Ye Xin T, Qi C, Rui Zhao Y (2000) Survey of association rule mining. Appl Res Comput, p 1

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to YU Tong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Atlantis Press and the author(s)

About this paper

Cite this paper

Tong, Y., Meide, X. (2016). An Algorithm for Mining Association Rules Based on the Database Characteristic Matrix. In: Qi, E. (eds) Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-145-1_8

Download citation

Publish with us

Policies and ethics