Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams (Q895536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5715665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Networks and Decision Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing and Solving Decision Problems with Limited Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mini-buckets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational theory of decision networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Limited Memory Influence Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk, Ambiguity, and the Savage Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Imprecise Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Credal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Inference in Credal Networks: New Complexity Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2U: an exact interval propagation algorithm for polytrees with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating credal networks is approximable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential decision making with partially ordered preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up k-Neighborhood Local Search in Limited Memory Influence Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary join trees for computing marginals in the Shenoy-Shafer architecture / rank
 
Normal rank

Latest revision as of 04:21, 11 July 2024

scientific article
Language Label Description Also known as
English
Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
scientific article

    Statements

    Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams (English)
    0 references
    3 December 2015
    0 references
    Bayesian networks
    0 references
    maximum a posteriori inference
    0 references
    influence diagrams
    0 references
    maximum expected utility
    0 references
    computational complexity
    0 references

    Identifiers