Sciweavers

506 search results - page 34 / 102
» Learning Bayesian Networks from Incomplete Databases
Sort
View
AAAI
2011
13 years 10 months ago
Mean Field Inference in Dependency Networks: An Empirical Study
Dependency networks are a compelling alternative to Bayesian networks for learning joint probability distributions from data and using them to compute probabilities. A dependency ...
Daniel Lowd, Arash Shamaei
FLAIRS
2001
14 years 11 months ago
Maximal Prime Subgraph Decomposition of Bayesian Networks
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
Kristian G. Olesen, Anders L. Madsen
INFOCOM
2008
IEEE
15 years 4 months ago
Minerva: Learning to Infer Network Path Properties
—Knowledge of the network path properties such as latency, hop count, loss and bandwidth is key to the performance of overlay networks, grids and p2p applications. Network operat...
Rita H. Wouhaybi, Puneet Sharma, Sujata Banerjee, ...
ACL
2012
13 years 8 days ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
NIPS
2008
14 years 11 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink