Sciweavers

124 search results - page 1 / 25
» Efficient Algorithms for Conditional Independence Inference
Sort
View
JMLR
2010
102views more  JMLR 2010»
12 years 11 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
AI
2006
Springer
13 years 8 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
IJAR
2007
69views more  IJAR 2007»
13 years 4 months ago
Racing algorithms for conditional independence inference
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
Remco R. Bouckaert, Milan Studený
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...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 6 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...