NESTOR
From MaRDI portal
Cited in
(29)- Distributed revision of composite beliefs
- Evidential reasoning using stochastic simulation of causal models
- Exploiting case-based independence for approximating marginal probabilities
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- Electronic circuit diagnostic expert systems - a survey
- Cost-based abduction and MAP explanation
- Information and probabilistic reasoning
- An optimal approximation algorithm for Bayesian inference
- Learning Bayesian network parameters from small data sets: a further constrained qualitatively maximum a posteriori method
- Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
- Incremental conditioning of lower and upper probabilities
- The role of relevance in explanation. II: Disjunctive assignments and approximate independence
- Increased robustness of Bayesian networks through probability intervals
- An adaptive reasoning approach towards effficient ordering of composite hypotheses
- Model construction operators
- The role of relevance in explanation. I: Irrelevance as statistical independence
- Learning Bayesian network parameters under order constraints
- The computational complexity of probabilistic inference using Bayesian belief networks
- The principle of interval constraints: A generalization of the symmetric Dirichlet distribution
- Fundamental concepts of qualitative probabilistic networks
- DENDRAL
- Most probable explanations in Bayesian networks: complexity and tractability
- Geometry Tutor
- A new multivariate imputation method based on Bayesian networks
- An intuitive risk factors search algorithm: usage of the Bayesian network technique in personalized medicine
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Probabilistic inference in multiply connected belief networks using loop cutsets
This page was built for software: NESTOR
