Sciweavers

115 search results - page 6 / 23
» On Axiomatizing Probabilistic Conditional Independencies in ...
Sort
View
FLAIRS
2004
13 years 9 months ago
Computing Marginals with Hierarchical Acyclic Hypergraphs
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independen...
S. K. Michael Wong, Tao Lin
IJAR
2006
89views more  IJAR 2006»
13 years 7 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
AUSAI
2005
Springer
14 years 1 months ago
Conditioning Graphs: Practical Structures for Inference in Bayesian Networks
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
Kevin Grant, Michael C. Horsch
AI
2008
Springer
13 years 7 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
IJCAI
1997
13 years 9 months ago
Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step...
David Poole