Finding optimal Bayesian networks by dynamic programming

  • Ajit P. Singh (5363735)
  • Andrew W. Moore (5402285)
ORKG logo Add to ORKG
Publication date
June 2018

Abstract

Abstract: "Finding the Bayesian network that maximizes a score function is known as structure learning or structure discovery. Most approaches use local search in the space of acyclic digraphs, which is prone to local maxima. Exhaustive enumeration requires super-exponential time. In this paper we describe a 'merely' exponential space/time algorithm for finding a Bayesian network that corresponds to a global maxima of a decomposable scoring function, such as BDeu or BIC.

Extracted data

Loading...

Related items

Learning Optimal Bayesian Networks with Heuristic Search
  • Malone, Brandon M
August 2012

Bayesian networks are a widely used graphical model which formalize reasoning under uncertainty. Unf...

Learning optimal Bayesian networks with heuristic search
  • Brandon M. Malone
January 2012

Bayesian networks are a widely used graphical model which formalize reasoning un-der uncertainty. Un...

A Simple Approach for Finding the Globally Optimal Bayesian Network Structure
  • Tomi Silander
  • Petri Myllymäki
February 2008

We study the problem of learning the best Bayesian network structure with respect to a decomposable ...

We use cookies to provide a better user experience.