Search
1999 Volume 14
Article Contents
RESEARCH ARTICLE   Open Access    

Learning probabilistic networks

More Information
  • 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.
  • 加载中
  • Cite this article

    PAUL J. KRAUSE. 1999. Learning probabilistic networks. The Knowledge Engineering Review. 13: doi: 10.1017/S0269888998004019
    PAUL J. KRAUSE. 1999. Learning probabilistic networks. The Knowledge Engineering Review. 13: doi: 10.1017/S0269888998004019

Article Metrics

Article views(10) PDF downloads(330)

Other Articles By Authors

RESEARCH ARTICLE   Open Access    

Learning probabilistic networks

The Knowledge Engineering Review  14 Article number: 10.1017/S0269888998004019  (1999)  |  Cite this article

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.

    • © 1999 Cambridge University Press
  • About this article
    Cite this article
    PAUL J. KRAUSE. 1999. Learning probabilistic networks. The Knowledge Engineering Review. 13: doi: 10.1017/S0269888998004019
    PAUL J. KRAUSE. 1999. Learning probabilistic networks. The Knowledge Engineering Review. 13: doi: 10.1017/S0269888998004019
  • Catalog

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return