Advertisement

IDAGs: A perfect map for any distribution

  • Remco R. Bouckaert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 747)

Abstract

The notion of relevance that is very important in knowledge based systems can be efficiently encoded by conditional independence. Although directed acyclic graphs (DAG) are powerful means for representing conditional independencies in probability distributions it is not always possible to find a DAG that represents all conditional independencies and dependencies of a distribution. We present a new formalism that is able to do this for positive probability distributions. The main issue is to augment a DAG with a special kind of arcs that induce independencies. Furthermore, an efficient algorithm is presented for building these extended DAGs.

Keywords

Direct Acyclic Graph Conditional Independence Independency Statement Independency Model Conditional Probability Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.R. Bouckaert. Optimizing causal orderings for generating dags from data. In Proceedings Uncertainty in Artificial Intelligence, pages 9–16, 1992.Google Scholar
  2. [2]
    R.R. Bouckaert. Conditional dependencies in probabilistic networks. In Proceedings 4th International Workshop on AI and Statistics, 1993.Google Scholar
  3. [3]
    A.P. Dawid. Conditional independence in statistical theory. Journal of the Royal Statistical Society B, 41(1):1–31, 1979.Google Scholar
  4. [4]
    J. Doyle. A truth maintenance system. Artificial Intelligence, 12:231–272, 1979.Google Scholar
  5. [5]
    D. Geiger. Graphoids: a qualitative framework for probabilistic inference. PhD thesis, UCLA, Cognitive Systems Laboratory, Computer Science Department, 1990.Google Scholar
  6. [6]
    M. Henrion. An introduction to algorithms for inference in belief nets. In Proceedings Uncertainty in Artificial Intelligence 5, pages 129–138, 1990.Google Scholar
  7. [7]
    S.L. Lauritzen, A.P. Dawid, A.P. Larsen, and H.G. Leimer. Independence properties of directed markov fields. Networks, Vol 20, pages 491–505, 1990.Google Scholar
  8. [8]
    S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their applications to expert systems (with discussion). J.R. Stat. Soc. (Series B),Vol. 50, pages 157–224, 1988.Google Scholar
  9. [9]
    J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, inc., San Mateo, CA, 1988.Google Scholar
  10. [10]
    J. Pearl, D. Geiger, and T. Verma. The logic of influence diagrams. In R.M. Oliver and J.Q. Smith, editors, Influence Diagrams, Belief Nets and Decision Analysis, pages 67–87. John Wiley & Sons Ltd., 1990.Google Scholar
  11. [11]
    T. Verma and J. Pearl. Causal networks: Semantics and expressiveness. In Proceedings Uncertainty in Artificial Intelligence, pages 352–359, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Remco R. Bouckaert
    • 1
  1. 1.Department of Computer ScienceUtrecht UniversityTB UtrechtThe Netherlands

Personalised recommendations