Sciweavers

115 search results - page 13 / 23
» On Axiomatizing Probabilistic Conditional Independencies in ...
Sort
View
IJPRAI
1998
100views more  IJPRAI 1998»
13 years 7 months ago
Obtaining The Correspondence between Bayesian and Neural Networks
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
Athena Stassopoulou, Maria Petrou
IJCAI
2007
13 years 9 months ago
A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 9 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...
ML
2008
ACM
100views Machine Learning» more  ML 2008»
13 years 7 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
IJAR
2010
152views more  IJAR 2010»
13 years 6 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...