Efficient designs for Bayesian networks with sub-tree bounds

DOI10.1007/S11222-015-9623-0MaRDI QIDQ518229zbMATH OpenOpenAlexFDO

Authors Marie Lilleborge, Jo Eidsvik

Publication date 28 March 2017

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11222-015-9623-0

zbMATH Keywords

Bayesian networksinformation measureupper and lower boundsdesign of experimentsubset selectionalmond treejunction tree algorithmpetroleum exploration

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Statistical aspects of information-theoretic topics (62B10) Bayesian inference (62F15) Optimal statistical designs (62K05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• An efficient Bayesian network structure learning strategy
• Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
• Efficient learning of Bayesian networks with bounded tree-width
• An optimization-based approach for the design of Bayesian networks
• Learning bounded tree-width Bayesian networks via sampling

Cites work

• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 5180199 (Why is no real title available?)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Bayesian Networks and Decision Graphs
• Information gathering in Bayesian networks applied to petroleum prospecting
• Model-based adaptive spatial sampling for occurrence map construction
• Modeling and Reasoning with Bayesian Networks
• On a Measure of the Information Provided by an Experiment
• On the measure of the information in a statistical experiment
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• Optimal sequential exploration: bandits, clairvoyants, and wildcats
• Optimal value of information in graphical models
• Probabilistic graphical models.
• Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction

Cited in

(1)

• Information gathering in Bayesian networks applied to petroleum prospecting

This page was built for publication: Efficient designs for Bayesian networks with sub-tree bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q518229)