The following pages link to Credal networks (Q1575697):
Displaying 50 items.
- Satisficing, preferences, and social interaction: a new perspective (Q333447) (← links)
- Sets of probability distributions, independence, and convexity (Q382995) (← links)
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach (Q473383) (← links)
- Independent products in infinite spaces (Q486580) (← links)
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (Q490443) (← links)
- A new heuristic for learning Bayesian networks from limited datasets: a real-time recommendation system application with RFID systems in grocery stores (Q512941) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- The multilabel naive credal classifier (Q518629) (← links)
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees (Q622263) (← links)
- Efficient solutions to factored MDPs with imprecise transition probabilities (Q646498) (← links)
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
- PRM inference using Jaffray \& Faÿ's local conditioning (Q649983) (← links)
- Independent natural extension (Q650526) (← links)
- Updating beliefs with incomplete observations (Q814629) (← links)
- Graphoid properties of epistemic irrelevance and independence (Q819940) (← links)
- Epistemic irrelevance on sets of desirable gambles (Q819949) (← links)
- A graphical study of comparative probabilities (Q825132) (← links)
- Fast algorithms for robust classification with Bayesian nets (Q881796) (← links)
- Computing lower and upper expectations under epistemic independence (Q881798) (← links)
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799) (← links)
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams (Q895536) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Real-time dynamic programming for Markov decision processes with imprecise probabilities (Q901046) (← links)
- Demystifying dilation (Q907893) (← links)
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks (Q962637) (← links)
- Partially observable Markov decision processes with imprecise parameters (Q1028935) (← links)
- Updating coherent previsions on finite spaces (Q1037943) (← links)
- Compositional models for credal sets (Q1678447) (← links)
- A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams (Q1688716) (← links)
- On extreme points of p-boxes and belief functions (Q1688722) (← links)
- Probabilistic opinion pooling with imprecise probabilities (Q1702976) (← links)
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems (Q1711885) (← links)
- Robustifying sum-product networks (Q1726242) (← links)
- Efficient belief propagation in second-order Bayesian networks for singly-connected graphs (Q1726384) (← links)
- Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods (Q2051254) (← links)
- A new score for adaptive tests in Bayesian and credal networks (Q2146042) (← links)
- Tractable inference in credal sentential decision diagrams (Q2206447) (← links)
- Modelling epistemic irrelevance with choice functions (Q2206448) (← links)
- An axiomatic framework for influence diagram computation with partially ordered preferences (Q2206449) (← links)
- Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity (Q2237163) (← links)
- Information graphs and their use for Bayesian network graph construction (Q2237518) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval (Q2282037) (← links)
- Learning with imprecise probabilities as model selection and averaging (Q2330013) (← links)
- Approximate credal network updating by linear programming with applications to decision making (Q2344362) (← links)
- Extreme points of the credal sets generated by comparative probabilities (Q2348072) (← links)
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms (Q2353979) (← links)
- Evaluating interval-valued influence diagrams (Q2374538) (← links)
- Updating credal networks is approximable in polynomial time (Q2375322) (← links)
