scientific article; zbMATH DE number 5547867

MaRDI QIDQ3624045zbMATH OpenFDO

Authors Bozhena Bidyuk, Rina Dechter

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1110.2740

zbMATH Keywords

memory-based inference algorithmsRao-Blackwellisation principle

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Cuts in Bayesian graphical models
• Efficient Sampling and Structure Learning of Bayesian Networks
• Multi-domain sampling with applications to structural inference of Bayesian networks
• Gibbs sampling in Bayesian networks
• Bayesian networks: regenerative Gibbs samplings
• Probabilistic inference in multiply connected belief networks using loop cutsets
• Sampling for conditional inference on network data
• Structure learning in Bayesian networks of a moderate size by efficient sampling
• Learning bounded tree-width Bayesian networks via sampling

Cited in

(12)

• A statistical approach to adaptive problem solving
• Importance sampling-based estimation over AND/OR search spaces for graphical models
• Stochastic approximation cut algorithm for inference in modularized Bayesian models
• Learning accurate cutset networks by exploiting decomposability
• Active tuples-based scheme for bounding posterior beliefs
• scientific article; zbMATH DE number 1467487 (Why is no real title available?)
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning
• Ancestral Gumbel-top-k sampling for sampling without replacement
• SampleSearch: importance sampling in presence of determinism
• Cuts in Bayesian graphical models
• Conjunctive queries with free access patterns under updates
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem

Describes a project that uses

Uses Software

• AIS-BN

This page was built for publication:

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