Dempster's rule for evidence ordered in a complete directed acyclic graph (Q1308977): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives on the theory and practice of belief functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rejoinders to comments on ''Perspectives on the theory and practice of belief functions'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nonspecific evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Dempster's rule for hierarchical evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagating belief functions in qualitative Markov trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803940 / rank
 
Normal rank

Latest revision as of 10:57, 22 May 2024

scientific article
Language Label Description Also known as
English
Dempster's rule for evidence ordered in a complete directed acyclic graph
scientific article

    Statements

    Dempster's rule for evidence ordered in a complete directed acyclic graph (English)
    0 references
    0 references
    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

    Identifiers