scientific article; zbMATH DE number 4121482
From MaRDI portal
Publication:4734791
Recommendations
Cited in
(only showing first 100 items - show all)- A simple graphical approach for understanding probabilistic inference in Bayesian networks
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
- A selective view of stochastic inference and modeling problems in nanoscale biophysics
- Propagating belief functions in qualitative Markov trees
- Uncertain evidence and artificial analysis
- On the applicability of maximum entropy to inexact reasoning
- Tree clustering for constraint networks
- Simplicial decompositions of graphs: A survey of applications
- Importance sampling algorithms for the propagation of probabilities in belief networks
- Exploiting case-based independence for approximating marginal probabilities
- A modified simulation scheme for inference in Bayesian networks
- Characterizing the principle of minimum cross-entropy within a conditional-logical framework
- R \& D decision advisor: An interactive approach to normative decision system model construction
- Fusion and propagation with multiple observations in belief networks
- How much do you believe!
- Bayesian diagnosis in expert systems
- Connectionist learning of belief networks
- Use of the Gibbs sampler in expert systems
- On the complexity of belief network synthesis and refinement
- Studies on hypergraphs. I: Hyperforests
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- Chordal graph models of contingency tables
- Normal linear regression models with recursive graphical Markov structure
- Approximating MAPs for belief networks is NP-hard and other theorems
- Analysis of notions of diagnosis
- Image analysis with partially ordered Markov models.
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
- Fast Bayes and the dynamic junction forest
- Approximate representation of probabilistic data in expert systems
- Artificial intelligence and human decision making
- Probabilistic Horn abduction and Bayesian networks
- A model of belief
- Potential influence diagrams
- Probabilistic multi-knowledge-base systems
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Finding MAPs for belief networks is NP-hard
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- A comparison of graphical techniques for decision analysis
- A computational theory of decision networks
- Soft evidential update for probabilistic multiagent systems
- On finding a cycle basis with a shortest maximal cycle
- Modeling temporal processes via belief networks and Petri nets, with application to expert systems
- Logical and algorithmic properties of independence and their application to Bayesian networks
- Probability propagation
- Information and probabilistic reasoning
- A characterization of Markov equivalence classes for acyclic digraphs
- A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
- Inferencing the graphs of causal Markov fields
- Conditionally externally Bayesian pooling operators in chain graphs
- Modeling probabilistic networks of discrete and continuous variables
- Handling multiple sources of variation using influence diagrams
- Using hidden nodes in Bayesian networks
- Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
- Irrelevance and parameter learning in Bayesian networks
- Resource bounded and anytime approximation of belief function computations.
- Fuzzy functional dependencies and Bayesian networks
- An optimal approximation algorithm for Bayesian inference
- Multi-agent influence diagrams for representing and solving games.
- Factorization of posteriors and partial imputation algorithm for graphical models with missing data.
- An alternative characterization of a Bayesian network.
- Hyper-EM for large recursive models of categorical variables.
- Importance sampling in Bayesian networks using probability trees.
- A practical algorithm for making filled graphs minimal
- Probability judgment in artificial intelligence and expert systems. With discussion
- Belief updating in multiply sectioned Bayesian networks without repeated local propagations
- A new approach for learning belief networks using independence criteria
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Context-specific sign-propagation in qualitative probabilistic networks
- An improved method for solving hybrid influence diagrams
- Optimal smoothing for spherical Gauss-Markov random fields with application to weather data estimation
- Compositional models for credal sets
- An empirical study of testing independencies in Bayesian networks using rp-separation
- A peeling algorithm for multiple testing on a random field
- Regularized Gaussian belief propagation
- Equivalence classes of staged trees
- Robustifying sum-product networks
- Approximate inference in Bayesian networks: parameterized complexity results
- Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator
- A branch-and-price-and-cut method for computing an optimal bramble
- Dynamic importance sampling in Bayesian networks based on probability trees
- Graphical models for genetic analyses
- Tree decompositions with small cost
- Anytime anyspace probabilistic inference
- Information gathering in Bayesian networks applied to petroleum prospecting
- Stable graphical model estimation with random forests for discrete, continuous, and mixed variables
- Unifying Markov properties for graphical models
- Inference in belief networks: A procedural guide
- On evidence absorption for belief networks
- Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
- A theory of Gaussian belief functions
- Increased robustness of Bayesian networks through probability intervals
- Hybrid algorithms for approximate belief updating in Bayes nets
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- A comparative study of possibilistic conditional independence and lack of interaction
- Activity graphs: A language for flexible consultation systems
- A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
- Reasoning from non-stationarity
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Computing marginals for arbitrary subsets from marginal representation in Markov trees
- Ordered valuation algebras: A generic framework for approximating inference
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 Q4734791)
