Sciweavers

56 search results - page 1 / 12
» Approximation of Data by Decomposable Belief Models
Sort
View
IPMU
2010
Springer
13 years 3 months ago
Approximation of Data by Decomposable Belief Models
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
Radim Jirousek
IAT
2005
IEEE
13 years 10 months ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu
WABI
2007
Springer
157views Bioinformatics» more  WABI 2007»
13 years 10 months ago
Composing Globally Consistent Pathway Parameter Estimates Through Belief Propagation
Abstract. Parameter estimation of large bio-pathway models is an important and difficult problem. To reduce the prohibitive computational cost, one approach is to decompose a large...
Geoffrey Koh, Lisa Tucker-Kellogg, David Hsu, P. S...
JMLR
2006
148views more  JMLR 2006»
13 years 4 months ago
Walk-Sums and Belief Propagation in Gaussian Graphical Models
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
Dmitry M. Malioutov, Jason K. Johnson, Alan S. Wil...
CIKM
2010
Springer
13 years 3 months ago
Decomposing background topics from keywords by principal component pursuit
Low-dimensional topic models have been proven very useful for modeling a large corpus of documents that share a relatively small number of topics. Dimensionality reduction tools s...
Kerui Min, Zhengdong Zhang, John Wright, Yi Ma