Approximate Bayesian Network Classifiers

  • Authors:
  • Dominik Slezak;Jakub Wroblewski

  • Affiliations:
  • -;-

  • Venue:
  • TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.