Skip to main content

Deduction in Logic of Association Rules

Poster Abstract

  • Conference paper
  • First Online:
Advances in Computing Science — ASIAN’99 (ASIAN 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1742))

Included in the following conference series:

  • 235 Accesses

Abstract

Knowledge discovery in database (KDD for short) is fast growing discipline of informatics. It aims at finding new, yet unknown and potentially useful patterns in large databases. Association rules [1] are very popular form of knowledge ex- tracted from databases. The goal of KDD can be e.g. finding interesting patterns concerning dependency of quality of loans on various attributes which can be de- rived from a bank database. These attributes can be arranged e.g. in data matrix LOANS in Tab. 1. There are n loans, each loan corresponds to one row of data matrix. Each column corresponds to an attribute derived from the database. Column TOWN contains information about domicile of the owner of the loan, column AGE contains age of the owner (in years). Column LOAN describes the quality of the loan (OK or BAD). Let us emphasize that usually there are tens of attributes describing both static (TOWN, AGE) and dynamic characteristics (derived e.g. from the transactions) of owners of loans.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Aggraval, R. et al: Fast Discovery of Association Rules. In Fayyad, U. M. et al.: Advances in Knowledge Discovery and Data Mining. AAAI Press / The MIT Press, 1996. 307–328

    Google Scholar 

  2. Hájek, P., Havránek T.: Mechanising Hypothesis Formation-Mathematical Foundations for a General Theory. Berlin-Heidelberg-New York, Springer-Verlag, 1978, 396 p.

    Google Scholar 

  3. Rauch, J.: Logical Calculi for Knowledge Discovery in Databases. In Principles of Data Mining and Knowledge Discovery, (J. Komorowski and J. Zytkow, eds.), Springer Verlag, Berlin, 47–57, 1997.

    Google Scholar 

  4. Rauch, J.: Classes of Four-Fold Table Quantifiers. In Principles of Data Mining and Knowledge Discovery, (J. Zytkow and M. Quafafou, eds.), Springer Verlag, Berlin, 203–211, 1998.

    Chapter  Google Scholar 

  5. Rauch, J.: Four-Fold Table Calculi and Missing Information. In JCIS’98 Proceedings, (Paul P. Wang, editor), Association for Intelligent Machinery, 375–378, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rauch, J. (1999). Deduction in Logic of Association Rules. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-46674-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66856-5

  • Online ISBN: 978-3-540-46674-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics