Efficient designs for Bayesian networks with sub-tree bounds

DOI10.1007/S11222-015-9623-0zbMath1505.62247OpenAlexW2282295581MaRDI QIDQ518229

Jo Eidsvik, Marie Lilleborge

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 networksupper and lower boundssubset selectioninformation measuredesign of experimentalmond treejunction tree algorithmpetroleum exploration

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-based adaptive spatial sampling for occurrence map construction
• Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction
• Information gathering in Bayesian networks applied to petroleum prospecting
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats
• On a Measure of the Information Provided by an Experiment
• Bayesian Networks and Decision Graphs
• Modeling and Reasoning with Bayesian Networks
• Optimal Value of Information in Graphical Models
• On the measure of the information in a statistical experiment

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