Learning probabilistic networks

Paul J. Krause

The Knowledge Engineering Review · 1999 · 89 citations · 51 references

Concepts

TL;DR

A probabilistic network is a graphical model that encodes probabilistic relationships and qualitative influences between variables, making it ideal for integrating prior knowledge with data. The paper aims to demonstrate how data can be used to revise both the parameters and structure of a probabilistic network, beginning with an introduction to probability theory and graphical models. The authors present methods for learning probabilistic networks from data, including parameter and structure revision and handling incomplete data. The paper concludes by discussing how the presented learning techniques can be applied to infer causal relationships among variables in a domain.

Abstract

A probabilistic network is a graphical model that encodes probabilistic relationships between variables of interest. Such a model records qualitative influences between variables in addition to the numerical parameters of the probability distribution. As such it provides an ideal form for combining prior knowledge, which might be limited solely to experience of the influences between some of the variables of interest, and data. In this paper, we first show how data can be used to revise initial estimates of the parameters of a model. We then progress to showing how the structure of the model can be revised as data is obtained. Techniques for learning with incomplete data are also covered. In order to make the paper as self contained as possible, we start with an introduction to probability theory and probabilistic graphical models. The paper concludes with a short discussion on how these techniques can be applied to the problem of learning causal relationships between variables in a domain of interest.

References

51