Modeling and Reasoning with Bayesian Networks
From MaRDI portal
Publication:3632890
DOI10.1017/CBO9780511811357zbMath1231.68003WikidataQ59410342 ScholiaQ59410342MaRDI QIDQ3632890
Publication date: 15 June 2009
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) General topics in artificial intelligence (68T01)
Related Items
Epistemology of causal inference in pharmacology, Towards a framework for the assessment of harms ⋮ The Bayesian ontology language \(\mathcal {BEL}\) ⋮ Lifted generative learning of Markov logic networks ⋮ Learning along a channel: the expectation part of expectation-maximisation ⋮ Data fusion using Hilbert space multi-dimensional models ⋮ An extended depth-first search algorithm for optimal triangulation of Bayesian networks ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ On the Analysis of Probability-Possibility Transformations: Changing Operations and Graphical Models ⋮ All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ Same-decision probability: a confidence measure for threshold-based decisions ⋮ Exploiting local and repeated structure in dynamic Bayesian networks ⋮ A multi-objective evolutionary algorithm for enhancing Bayesian networks hybrid-based modeling ⋮ Explainable AI using MAP-independence ⋮ Fine-tuning the odds in Bayesian networks ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Hybrid semiparametric Bayesian networks ⋮ Simulation-regression approximations for value of information analysis of geophysical data ⋮ How many diagnoses do we need? ⋮ Algebraic model counting ⋮ The effect of combination functions on the complexity of relational Bayesian networks ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis ⋮ Quantitative possibility theory: logical- and graphical-based representations ⋮ Minimum Average Distance Clique Trees ⋮ Approximate counting in SMT and value estimation for probabilistic programs ⋮ Hierarchical estimation of parameters in Bayesian networks ⋮ Logical perspectives on the foundations of probability ⋮ Propagation effects of model-calculated probability values in Bayesian networks ⋮ An empirical study of testing independencies in Bayesian networks using rp-separation ⋮ On pruning with the MDL score ⋮ Motivating explanations in Bayesian networks using MAP-independence ⋮ The Probabilistic Description Logic ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Bayesian network inference using marginal trees ⋮ The YODO algorithm: an efficient computational framework for sensitivity analysis in Bayesian networks ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ A principled approach to expectation maximisation and latent Dirichlet allocation using Jeffrey's update rule ⋮ Tractable inference in credal sentential decision diagrams ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction ⋮ Analysing organic food buyers' perceptions with Bayesian networks: a case study in Turkey ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ A review on evolutionary algorithms in Bayesian network learning and inference tasks ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ Robustifying sum-product networks ⋮ Smooth, identifiable supermodels of discrete DAG models with latent variables ⋮ A generic framework for a compilation-based inference in probabilistic and possibilistic networks ⋮ Information graphs and their use for Bayesian network graph construction ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Using Four Cost Measures to Determine Arc Reversal Orderings ⋮ Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach ⋮ Learning Bayesian network parameters under equivalence constraints ⋮ Uncertainty Quantification for Markov Random Fields ⋮ Margins of discrete Bayesian networks ⋮ The Gaussian Polytree EDA with Copula Functions and Mutations ⋮ Improving post-disaster road network accessibility by strengthening links against failures ⋮ Efficient designs for Bayesian networks with sub-tree bounds ⋮ On the complexity of propositional and relational credal networks ⋮ Expert judgement for dependence in probabilistic modelling: a systematic literature review and future research directions ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models ⋮ Inferring interventions in product-based possibilistic causal networks ⋮ Spatial distribution prediction of oil and gas based on Bayesian network with case study ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Most frugal explanations in Bayesian networks ⋮ Approximate structure learning for large Bayesian networks ⋮ Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets ⋮ A hierarchy of sum-product networks using robustness ⋮ On the relative expressiveness of Bayesian and neural networks ⋮ Graphs for Margins of Bayesian Networks ⋮ \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits ⋮ Jeffrey's rule of conditioning in a possibilistic framework ⋮ Binary naive possibilistic classifiers: Handling uncertain inputs ⋮ Learning tractable Bayesian networks in the space of elimination orders ⋮ Optimizing group learning: an evolutionary computing approach ⋮ Hilbert space multidimensional modelling of continuous measurements ⋮ Graphical Models for Processing Missing Data ⋮ A geometric characterization of sensitivity analysis in monomial models ⋮ Handling Interventions with Uncertain Consequences in Belief Causal Networks ⋮ Inference using compiled min-based possibilistic causal networks in the presence of interventions ⋮ Dealing with external actions in belief causal networks ⋮ Lifted Dynamic Junction Tree Algorithm
Uses Software
This page was built for publication: Modeling and Reasoning with Bayesian Networks
