Floating search algorithm for structure learning of Bayesian network classifiers

  • Authors:
  • Franz Pernkopf;Paul O'Leary

  • Affiliations:
  • Institute of Communications and Wave Propagation, Graz University of Technology, Inffeldgasse 16c II, Graz, 8010 Austria;Institute of Automation, University of Leoben, Leoben 8700, Austria

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.10

Visualization

Abstract

This paper presents a floating search approach for learning the network structure of Bayesian network classifiers. A Bayesian network classifier is used which in combination with the search algorithm allows simultaneous feature selection and determination of the structure of the classifier.The introduced search algorithm enables conditional exclusions of previously added attributes and/or arcs from the network classifier. Hence, this algorithm is able to correct the network structure by removing attributes and/or arcs between the nodes if they become superfluous at a later stage of the search. Classification results of selective unrestricted Bayesian network classifiers are compared to naïve Bayes classifiers and tree augmented naïve Bayes classifiers. Experiments on different data sets show that selective unrestricted Bayesian network classifiers achieve a better classification accuracy estimate in two domains compared to tree augmented naïve Bayes classifiers, whereby in the remaining domains the performance is similar. However, the achieved network structure of selective unrestricted Bayesian network classifiers is simpler.