Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependences

@inproceedings{Kjjrull1994ReductionOC,
  title={Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependences},
  author={Uue Kjjrull},
  year={1994}
}
  • Uue Kjjrull
  • Published 1994
The paper presents a method for reducing the computational complexity of Bayesian networks through identiication and removal of weak dependences (removal of links from the (moralized) independence graph). The removal of a small number of links may reduce the computational complexity dramatically , since several ll-ins and moral links may be rendered superruous by the removal. The method is described in terms of impact on the independence graph, the junction tree, and the potential functions… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

The chain graph

  • M. Frydenberg
  • 1989
Highly Influential
6 Excerpts

Representation of irrel

  • R. Y. Geva, A. Paz
  • 1992
Highly Influential
5 Excerpts

Junction trees and decompos

  • F. V. Jensen
  • 1988
Highly Influential
6 Excerpts

Et forprojekt til et ekspertsystem

  • J. sen
  • 1989
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…