Sciweavers

42 search results - page 2 / 9
» Racing algorithms for conditional independence inference
Sort
View
AI
2006
Springer
13 years 9 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
BMCBI
2010
147views more  BMCBI 2010»
13 years 5 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
JMLR
2011
145views more  JMLR 2011»
13 years 7 days ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey
UAI
1996
13 years 6 months ago
Context-Specific Independence in Bayesian Networks
Bayesiannetworks provide a languagefor qualitatively representing the conditional independence properties of a distribution. This allows a natural and compact representation of th...
Craig Boutilier, Nir Friedman, Moisés Golds...
AAAI
1996
13 years 6 months ago
Irrelevance and Conditioning in First-Order Probabilistic Logic
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
Daphne Koller, Joseph Y. Halpern