Sciweavers

85 search results - page 12 / 17
» Exploiting Causal Independence in Large Bayesian Networks
Sort
View
UAI
2008
13 years 9 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
NIPS
2007
13 years 9 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
JMLR
2002
102views more  JMLR 2002»
13 years 7 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
CISIS
2010
IEEE
14 years 2 months ago
Computational Grid as an Appropriate Infrastructure for Ultra Large Scale Software Intensive Systems
—Ultra large scale (ULS) systems are future software intensive systems that have billions of lines of code, composed of heterogeneous, changing, inconsistent and independent elem...
Babak Rezaei Rad, Fereidoon Shams Aliee
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 11 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp