Dempster's rule for evidence ordered in a complete directed acyclic graph.
Ulla BergstenJohan SchubertPublished in: Int. J. Approx. Reason. (1993)
Keyphrases
- directed acyclic graph
- combination rule
- dempster shafer theory
- evidence theory
- equivalence class
- conditional independence
- transitive closure
- random variables
- belief functions
- causal models
- directed graph
- shortest path problem
- event calculus
- structural learning
- causal discovery
- structural equation models
- equivalence classes
- dempster shafer
- rule sets
- markov random field