2016Wiley StatsRef: Statistics Reference OnlineRequires access

B ayesian Graphical Models

Finn V. Jensen, Thomas D. Nielsen

Open publisher page 12 citations

Abstract

Abstract Mathematically, a Bayesian graphical model is a compact representation of the joint probability distribution for a set of variables. The most frequently used type of Bayesian graphical models are Bayesian networks. The structural part of a Bayesian graphical model is a graph consisting of nodes and edges. The nodes represent variables, which may be either discrete or continuous. An edge between two nodes and indicates a direct influence between the state of and the state of , which in some domains can also be interpreted as a causal relation. The widespread use of Bayesian networks is largely due to the availability of efficient inference algorithms for answering probabilistic queries about the states of the variables in the network. Furthermore, to support the construction of Bayesian network models, learning algorithms are also available. We give an overview of the Bayesian network formalism and some of the algorithmic developments in the area.

About this research paper

What this paper is about

Abstract Mathematically, a Bayesian graphical model is a compact representation of the joint probability distribution for a set of variables. The most frequently used type of Bayesian graphical models are Bayesian networks. The structural part of a Bayesian graphical model is a graph consisting of nodes and edges. The nodes represent variables, which may be either discrete or continuous. An edge between two nodes and indicates a direct influence between the state of and the state of , which in some domains can also be interpreted as a causal relation. The widespread use of Bayesian networks is largely due to the availability of efficient inference algorithms for answering probabilistic queries about the states of the variables in the network. Furthermore, to support the construction of Bayesian network models, learning algorithms are also available. We give an overview of the Bayesian network formalism and some of the algorithmic developments in the area.

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Mathematically, a Bayesian graphical model is a compact representation of the joint probability distribution for a set of variables. The most frequently used type of Bayesian graphical models are Bayesian networks. The structural part of a Bayesian graphical model is a graph consisting of nodes and edges. The nodes represent variables, which may be either discrete or continuous. An edge between two nodes and indicates a direct influence between the state of and the state of , which in some domains can also be interpreted as a causal relation. The widespread use of Bayesian networks is largely due to the availability of efficient inference algorithms for answering probabilistic queries about the states of the variables in the network. Furthermore, to support the construction of Bayesian network models, learning algorithms are also available. We give an overview of the Bayesian network formalism and some of the algorithmic developments in the area.

Key concepts: Graphical model, Bayesian network, Variable-order Bayesian network, Computer science, Variable elimination, Bayesian probability, Bayesian inference, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
B ayesian Graphical Models — Research Paper | ScholarLens