Computing the decomposable entropy of belief-function graphical models

DOI10.1016/J.IJAR.2023.108984MaRDI QIDQ6178723zbMATH OpenOpenAlexFDO

Authors Radim Jiroušek, Václav Kratochvíl, Prakash P. Shenoy

Publication date 4 September 2023

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ijar.2023.108984

zbMATH Keywords

belief-function directed graphical modelsbelief-function undirected graphical modelsdecomposable entropyDempster-Shafer theory of belief functions

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites work

• A Decomposable Entropy of Belief Functions in the Dempster-Shafer Theory
• A Mathematical Theory of Communication
• A new definition of entropy of belief functions in the Dempster-Shafer theory
• Belief function independence. II: The conditional case.
• Belief function independence: I. The marginal case
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• Computing the decomposable entropy of belief-function graphical models
• Conditional independence in valuation-based systems
• Entropy for evaluation of Dempster-Shafer belief function models
• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 3787826 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 3271180 (Why is no real title available?)
• Local computation with valuations from a commutative semigroup
• Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach
• Markov fields and log-linear interaction models for contingency tables
• On conditional belief functions in directed graphical models in the Dempster-Shafer theory
• On properties of a new decomposable entropy of Dempster-Shafer belief functions
• Propagating belief functions in qualitative Markov trees
• Reasoning in evidential networks with conditional belief functions
• Resource bounded and anytime approximation of belief function computations.
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The problem of dependent evidence
• Upper and Lower Probabilities Induced by a Multivalued Mapping

Cited in

(3)

• Computing the decomposable entropy of belief-function graphical models
• Entropy-Based Learning of Compositional Models from Data
• Conditional plausibility entropy of belief functions based on Dempster conditioning

This page was built for publication: Computing the decomposable entropy of belief-function graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178723)