Skip to main content

Application of Bayesian Confirmation Measures for Mining Rules from Support-Confidence Pareto-Optimal Set

(Invited Paper)

  • Conference paper
Book cover Artificial Intelligence and Soft Computing – ICAISC 2006 (ICAISC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4029))

Included in the following conference series:

Abstract

We investigate a monotone link between Bayesian confirmation measures and rule support and confidence. In particular, we prove that two confirmation measures enjoying some desirable properties are monotonically dependent on at least one of the classic dimensions being rule support and confidence. As the confidence measure is unable to identify and eliminate non-interesting rules, for which a premise does not confirm a conclusion, we propose to substitute the confidence for one of the considered confirmation measures. We also provide general conclusions for the monotone link between any confirmation measure enjoying some desirable properties and rule support and confidence.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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 between sets of items in massive databases. In: Proc. of the 1993 ACM-SIGMOD Int’l Conf. on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. Bayardo, R.J., Agrawal, R.: Mining the most interesting rules. In: Proc. of the Fifth ACM-SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 145–154 (1999)

    Google Scholar 

  3. Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proc. of the 1997 ACM-SIGMOD Int’l Conf. on the Management of Data, pp. 255–264 (1997)

    Google Scholar 

  4. Brzezinska, I., Slowinski, R.: Monotonicity of a Bayesian confirmation measure in rule support and confidence. In: Burczynski, T., Cholewa, W., Moczulski, W. (eds.) Recent Developments in Artificial Intelligence Methods, Gliwice. AI-METH Series, pp. 39–42 (2005)

    Google Scholar 

  5. Brzezinska, I., Greco, S., Slowinski, R.: Investigation of monotone link between confirmation measures and rule support and confidence. Research Report RA-025/05, Institute of Computing Science, Poznan University of Technology, Poznan (2005)

    Google Scholar 

  6. Christensen, D.: Measuring confirmation. Journal of Philosophy XCVI, 437–461 (1999)

    Article  Google Scholar 

  7. Clark, P., Boswell, P.: Rule induction with CN2: Some recent improvements. In: Machine Learning: Proc. of the Fifth European Conference, pp. 151–163 (1991)

    Google Scholar 

  8. Eells, E., Fitelson, B.: Symmetries and asymmetries in evidential support. Philosophical Studies 107(2), 129–142 (2002)

    Article  Google Scholar 

  9. Fitelson, B.: Studies in Bayesian Confirmation Theory. Ph.D. Thesis, University of Wisconsin, Madison (2001)

    Google Scholar 

  10. Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. In: Proc. of the 1996 ACM-SIGMOD Int’l Conf. on the Management of Data, pp. 13–23 (1996)

    Google Scholar 

  11. Good, I.J.: The best explicatum for weight of evidence. Journal of Statistical Computation and Simulation 19, 294–299 (1984)

    Article  Google Scholar 

  12. Greco, S., Pawlak, Z., Slowinski, R.: Can Bayesian confirmation measures be useful for rough set decision rules? Engineering Applications of Artificial Intelligence 17, 345–361 (2004)

    Article  Google Scholar 

  13. International Business Machines: IBM Intelligent Miner User’s Guide, Version 1, Release 1 (1996)

    Google Scholar 

  14. Morimoto, Y., Fukuda, T., Matsuzawa, H., Tokuyama, T., Yoda, K.: Algorithms for mining association rules for binary segmentation of huge categorical databases. In: Proc. of the 24th Very Large Data Bases Conf., pp. 380–391 (1998)

    Google Scholar 

  15. Morishita, S.: On classification and regression. In: Arikawa, S., Motoda, H. (eds.) DS 1998. LNCS (LNAI), vol. 1532, pp. 40–57. Springer, Heidelberg (1998)

    Google Scholar 

  16. Piatetsky-Shapiro, G.: Discovery, Analysis, and Presentation of Strong Rules. In: Knowledge Discovery in Databases, ch. 12, AAAI/MIT Press, Cambridge (1991)

    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

Slowinski, R., Brzezinska, I., Greco, S. (2006). Application of Bayesian Confirmation Measures for Mining Rules from Support-Confidence Pareto-Optimal Set. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_107

Download citation

  • DOI: https://doi.org/10.1007/11785231_107

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35748-3

  • Online ISBN: 978-3-540-35750-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics