Sciweavers

564 search results - page 43 / 113
» Approximation algorithms for restricted Bayesian network str...
Sort
View
ICML
2009
IEEE
16 years 1 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
103
Voted
ALT
2004
Springer
15 years 9 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
AAAI
1997
15 years 1 months ago
Effective Bayesian Inference for Stochastic Programs
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
Daphne Koller, David A. McAllester, Avi Pfeffer
98
Voted
UAI
1998
15 years 1 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
NIPS
2007
15 years 2 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