Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-06T10:37:17.075Z Has data issue: false hasContentIssue false

Learning probabilistic networks

Published online by Cambridge University Press:  04 April 2001

PAUL J. KRAUSE
Affiliation:
Philips Research Laboratories, Crossoak Lane, Redhill, Surrey RH1 5HA, UK

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.

Type
Review Article
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)