Efficient Möbius Transformations and Their Applications to D-S Theory (Q3297817): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2992183460 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2107.07359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimmed Moebius inversion and graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Zeta Transforms for Lattices with Few Irreducibles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556137 / 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: Fast Möbius inversion in semimodular lattices and ER-labelable posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the Mobius transformation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Dempster's rule for hierarchical evidence / rank
 
Normal rank

Latest revision as of 02:59, 23 July 2024

scientific article
Language Label Description Also known as
English
Efficient Möbius Transformations and Their Applications to D-S Theory
scientific article

    Statements

    Efficient Möbius Transformations and Their Applications to D-S Theory (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2020
    0 references
    zeta transform
    0 references
    Möbius transform
    0 references
    distributive lattice
    0 references
    meet-closed subset
    0 references
    join-closed subset
    0 references
    fast Möbius transform
    0 references
    FMT
    0 references
    Dempster-Shafer theory
    0 references
    DST
    0 references
    belief functions
    0 references
    efficiency
    0 references
    information-based
    0 references
    complexity reduction
    0 references

    Identifiers