Discriminative learning of Bayesian network classifiers

  • Authors:
  • Franz Pernkopf

  • Affiliations:
  • Laboratory of Signal Processing and Speech Communication, Graz University of Technology, Graz, Austria

  • Venue:
  • AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, methods for discriminative learning of Bayesian networks used for classification, i.e. learning the structure and/or parameters by optimizing the class conditional probability directly, have been proposed. In this paper, we use a simple order-based greedy algorithm for learning a discriminative network structure. First, we establish an ordering of the features according to the information for classification. Given this ordering, we can find the structure consistent with this ordering in polynomial time. We introduce a new information theoretic score to learn the structure of a Bayesian network from an ordering. Furthermore, we provide a heuristic method for subsequent pruning of the learned network structure. This reduces the number of parameters and the performance may even improve due to overfitting effects, especially when the sample size for learning is small. Experiments have been performed on 25 data sets from the UCI repository. The experiments suggest that the discriminative structure found by our algorithm outperforms on average other generative and discriminative structure learning approaches.