Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Dempster’s rule of combination
Shafer G.  International Journal of Approximate Reasoning 79 26-40, 2016. Type: Article
Date Reviewed: Feb 22 2017

The rule of combination of belief functions on infinite sets of possibilities is developed in this paper. The author continues his developments on Dempster’s theory on lower probabilities in order to generalize already-obtained results in the framework of “theory of evidence” that are important for approximate reasoning using such a generalization of probability theory.

The paper is dedicated to researchers and scientists interested in approximate reasoning based on Dempster-Shafer theory. While the presentation is clear for readers having a background in this theory, beginners should study some important references recommended in the text.

Structured in seven sections, the presentation covers lower and upper integration (§2); product belief functions, which generalize the idea of a product probability measure preserving the continuity and condensability properties (§3); the notion of “evidentially independent subalgebras” (§4); Dempster’s rule of conditioning (§5); Dempster’s rule of combination (§6); and the notion of “cognitively independent subalgebras” with respect to a belief function (§7).

In my opinion, this well-written paper on an important subject, with complete proofs, good argumentation, and well-established connections and citations of the relevant scientific literature, should be highlighted by scientists from both the mathematics and computer science fields.

Reviewer:  G. Albeanu Review #: CR145073 (1705-0286)
Bookmark and Share
  Editor Recommended
Featured Reviewer
Approximation (G.1.2 )
Conditioning (G.1.3 ... )
Conditioning (And Ill-Conditioning) (G.1.0 ... )
Would you recommend this review?
Other reviews under "Approximation": Date
Low-rank approximation: algorithms, implementation, applications (2nd ed.)
Markovsky I.,  Springer International Publishing, New York, NY, 2019. 272 pp. Type: Book (978-3-319896-19-9)
Jul 18 2019
FPT approximation schemes for maximizing submodular functions
Skowron P.  Information and Computation 257(C): 65-78, 2017. Type: Article
Jan 4 2019
On an new algorithm for function approximation with full accuracy in the presence of discontinuities based on the immersed interface method
Amat S., Li Z., Ruiz J.  Journal of Scientific Computing 75(3): 1500-1534, 2018. Type: Article
Dec 6 2018

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy