Skip to main content

Approximate Bayesian Network Classifiers

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2002)

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

Included in the following conference series:

Abstract

Bayesian network (BN) is a directed acyclic graph encoding probabilistic independence statements between variables. BN with decision attribute as a root can be applied to classification of new cases, by synthesis of conditional probabilities propagated along the edges. We consider approximate BNs, which almost keep entropy of a decision table. They have usually less edges than classical BNs. They enable to model and extend the well-known Naive Bayes approach. Experiments show that classifiers based on approximate BNs can be very efficient.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bay, S.D.: The UCI Machine Learning Repository, http://www.ics.uci.edu/ml

  2. Box, G.E.P., Tiao, G.C.: Bayesian Inference in Statistical Analysis. Wiley (1992).

    Google Scholar 

  3. Buntine, W.: A guide to the literature on learning probabilistic networks from data. IEEE Transactions on Knowledge and Data Engineering (1996).

    Google Scholar 

  4. Kapur, J.N., Kesavan, H.K.: Entropy Optimization Principles with Applications. Academic Press (1992).

    Google Scholar 

  5. Pawlak, Z.: Rough sets-Theoretical aspects of reasoning about data. Kluwer Academic Publishers (1991).

    Google Scholar 

  6. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988).

    Google Scholar 

  7. Ślçezak, D.: Approximate Bayesian networks. In: B. Bouchon-Meunier, J. Gutierrez-Rios, L. Magdalena, R.R. Yager (eds), Technologies for Contructing Intelligent Systems 2: Tools. Springer-Verlag (2002) pp. 313–326.

    Google Scholar 

  8. Ślçezak, D., Wróblewski, J.: Order-based genetic algorithms for extraction of approximate bayesian networks from data. In: Proc. of IPMU’2002. France (2002).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slçezak, D., Wróblewski, J. (2002). Approximate Bayesian Network Classifiers. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45813-1_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics