Skip to main content

Probabilistic Approach to Association Rules in Incomplete Databases

  • Conference paper
  • First Online:

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

Abstract

In the paper we list a set of properties that characterize a legitimate approach to data incompleteness. An example of a legitimate probabilistic approach, which is based on attribute distribution, is presented. We also review and compare three other approaches to incompleteness: the one that ignores missing values, the approach applying only certain information, and the approach based on valid databases. All the three approaches turn out to be invalid.

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

Buying options

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

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 Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data. Washington, D.C. (1993) 207–216

    Google Scholar 

  2. Kononenko, I., Bratko, I., Roskar, E.: Experiments in Automatic Learning of Medical Diagnostic Rules. Technical Report. Jozef Stefan Institute, Ljubljana, Yugoslavia (1984)

    Google Scholar 

  3. Kryszkiewicz, M.: Association Rules in Incomplete Databases: In: Lecture Notes in Artificial Intelligence 1574, Methodologies for Knowledge Discovery and Data Mining, Proc. of Third Pacific-Asia Conference, PAKDD’ 99, Beijing, China, 26–28 1999, Springer (1999) 84–93

    Google Scholar 

  4. Quinlan J.R.: Induction of Decision Trees. In: Shavlik J. W., Dietterich T.G. (eds.): Readings in Machine Learning. Morgan Kaufmann Publishers (1990) 57–69

    Google Scholar 

  5. Ragel A., Cremilleux B.: Treatment of Missing Values for Association Rules. In: Proc. of Second Pacific Asia Conference, PAKDD’98. Melbourne, Australia. LNAI 1394. Research and Development in Knowledge Discovery and Data Mining. Springer (1998) 258–270

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kryszkiewicz, M. (2000). Probabilistic Approach to Association Rules in Incomplete Databases. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45151-X_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45151-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics