Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
From MaRDI portal
Publication:1380860
DOI10.1023/A:1007469629108zbMath0894.68124MaRDI QIDQ1380860
David Heckerman, David Maxwell Chickering
Publication date: 30 August 1998
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007469629108
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures, Penalized Estimation of Directed Acyclic Graphs From Discrete Data, Model-based multidimensional clustering of categorical data, A Gaussian mixed model for learning discrete Bayesian networks, Parallel exact inference on the cell broadband engine processor, The Bayesian method for causal discovery of latent-variable models from a mixture of experimental and observational data, Cost-sensitive feature acquisition and classification, Newtonian clustering: an approach based on molecular dynamics and global optimization, Learning failure-free PRISM programs, Bayesian multiscale smoothing in supervised and semi-supervised kernel discriminant analysis, Assessment of two approximation methods for computing posterior model probabilities, Boosted Bayesian network classifiers, Computational aspects of fitting mixture models via the expectation-maximization algorithm, A comparison of pruning criteria for probability trees, Greedy learning of latent tree models for multidimensional clustering, Investigation of the widely applicable Bayesian information criterion, Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty, Online Model Selection Based on the Variational Bayes, A Tutorial on Learning with Bayesian Networks, Inferring a Bayesian Network for Content-Based Image Classification
