Computing Marginals for Arbitrary Subsets from Marginal Representation in Markov Trees

@article{Xu1995ComputingMF,
  title={Computing Marginals for Arbitrary Subsets from Marginal Representation in Markov Trees},
  author={Hong Xu},
  journal={Artif. Intell.},
  year={1995},
  volume={74},
  pages={177-189}
}
Abstract Markov trees and clique trees are the alternative representations of valuation networks and belief networks that are used by local computational techniques for efficient reasoning. However, once the Markov tree has been created, the existing techniques can only compute the marginals for the vertices of the Markov tree or for a subset of variables which is contained in one vertex. This paper presents a method for computing the marginal for a subset which may not be contained in one… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Local Computation in Covering Join Trees Part #2

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Probabilistic Reasoning in Bayesian Networks: A Relational Database Approach

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Updating in Local Computation

  • Schneuwly Cesar
  • 2006
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Modified Component Valuations in Valuation Based Systems as a Way to Optimize Query Processing

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Answering Frequent Probabilistic Inference Queries in Databases

VIEW 1 EXCERPT
CITES BACKGROUND

A join tree probability propagation architecture for semantic modeling

VIEW 1 EXCERPT
CITES BACKGROUND

Calculating Likelihoods in Bayesian Networks

  • D.H. Glass
  • Computer Science
  • 2006 3rd International IEEE Conference Intelligent Systems
  • 2006
VIEW 1 EXCERPT
CITES METHODS

Focusing Strategies for Multiple Fault Diagnosis

VIEW 2 EXCERPTS
CITES METHODS