Dempster's rule for evidence ordered in a complete directed acyclic graph (Q1308977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 465555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dempster's rule for evidence ordered in a complete directed acyclic graph |
scientific article; zbMATH DE number 465555 |
Statements
Dempster's rule for evidence ordered in a complete directed acyclic graph (English)
0 references
17 April 1994
0 references
belief functions
0 references
Dempster-Shafer theory
0 references
evidential reasoning
0 references
uncertainty
0 references
propagation of evidence
0 references
partitions
0 references
complete directed acyclic graph
0 references
computational complexity
0 references
Dempster's rule
0 references
hierarchical network
0 references
0 references
0 references
0.8218192458152771
0 references
0.7893390655517578
0 references
0.7793759703636169
0 references
0.7696233987808228
0 references
0.7689480781555176
0 references
