Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
From MaRDI portal
(Redirected from Publication:1380860)
Recommendations
- Approximate inference in Bayesian networks: parameterized complexity results
- Approximation methods for efficient learning of Bayesian networks.
- The marginal factorization of Bayesian networks and its application
- scientific article; zbMATH DE number 1735978
- scientific article
- Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
Cited in
(28)- Cost-sensitive feature acquisition and classification
- Variational Bayesian learning of directed graphical models with hidden variables
- Computational aspects of fitting mixture models via the expectation-maximization algorithm
- Inferring a Bayesian Network for Content-Based Image Classification
- The Bayesian method for causal discovery of latent-variable models from a mixture of experimental and observational data
- scientific article; zbMATH DE number 1222294 (Why is no real title available?)
- Upper bound for variational free energy of Bayesian networks
- Assessment of two approximation methods for computing posterior model probabilities
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- An asymptotic behaviour of the marginal likelihood for general Markov models
- Boosted Bayesian network classifiers
- Newtonian clustering: an approach based on molecular dynamics and global optimization
- Investigation of the widely applicable Bayesian information criterion
- A Gaussian mixed model for learning discrete Bayesian networks
- Penalized estimation of directed acyclic graphs from discrete data
- Bayesian network models for incomplete and dynamic data
- Learning failure-free PRISM programs
- Bayesian multiscale smoothing in supervised and semi-supervised kernel discriminant analysis
- A Tutorial on Learning with Bayesian Networks
- Online model selection based on the variational Bayes
- Model-based multidimensional clustering of categorical data
- Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures
- Model averaging for prediction with discrete Bayesian networks
- A comparison of pruning criteria for probability trees
- Greedy learning of latent tree models for multidimensional clustering
- Improving the mean-field approximation in belief networks using Bahadur's reparameterisation of the multivariate binary distribution
- Parallel exact inference on the cell broadband engine processor
This page was built for publication: Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380860)
