Sciweavers

136 search results - page 19 / 28
» Context-Specific Independence in Bayesian Networks
Sort
View
DSP
2007
13 years 9 months ago
Blind separation of nonlinear mixtures by variational Bayesian learning
Blind separation of sources from nonlinear mixtures is a challenging and often ill-posed problem. We present three methods for solving this problem: an improved nonlinear factor a...
Antti Honkela, Harri Valpola, Alexander Ilin, Juha...
IJAR
2010
152views more  IJAR 2010»
13 years 8 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...
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
UAI
2008
13 years 11 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
AIME
2009
Springer
14 years 4 months ago
Causal Probabilistic Modelling for Two-View Mammographic Analysis
Abstract. Mammographic analysis is a difficult task due to the complexity of image interpretation. This results in diagnostic uncertainty, thus provoking the need for assistance by...
Marina Velikova, Maurice Samulski, Peter J. F. Luc...