Basic Formal Properties of A Relational Model of The Mathematical Theory of Evidence

The paper presents a novel view of the Dempster-Shafer belief function as a measure of diversity in relational data bases. It is demonstrated that under the interpretation The Dempster rule of evidence combination corresponds to the join operator of the relational database theory. This rough-set based interpretation is qualitative in nature and can represent a number of belief function operators. The interpretation has the property that Given a definition of the belief measure of objects in the interpretation domain we can perform operations in this domain and the measure of the resulting object is derivable from measures of component objects via belief operator. We demonstrated this property for Dempster rule of combination, marginalization, Shafer's conditioning, independent variables, Shenoy's notion of conditional independence of variables. The interpretation is based on rough sets (in connection with decision tables), but differs from previous interpretations of this type in that it counts the diversity rather than frequencies in a decision table.

• Publication year

  2017

• Venue

  arXiv.org

• Publication date

  2017-04-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  arXiv 1704.02468
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Advances in the Dempster-Shafer theory of evidence

  1994cited by this paper
• Conditional independence in valuation-based systems

  1994cited by this paper
• Boolean Reasoning for Decision Rules Generation

  1993cited by this paper
• Comments on shafer's "perspectives on the theory and practice of belief functions"

  1992cited by this paper
• Two Views of Belief: Belief as Generalized Probability and Belief as Evidence

  1992cited by this paper
• Resolving misunderstandings about belief functions

  1992cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991cited by this paper
• Managing uncertainty in expert systems

  1991cited by this paper
• Symbolic and Quantitative Approaches to Uncertainty

  1991cited by this paper
• Query Processing in Distributed Information Systems

  1991cited by this paper
• From the Rough Set Theory to the Evidence Theory

  1991influential reference
• SQL and relational databases

  1991cited by this paper
• A logic-based analysis of Dempster-Shafer theory

  1990cited by this paper
• Bayesian and belief-functions formalisms for evidential reasoning: a conceptual analysis

  1990cited by this paper
• The Bayesian and belief-function formalisms a general perspective for auditing

  1990cited by this paper
• Perspectives on the theory and practice of belief functions

  1990cited by this paper
• Probabilistic reasoning in intelligent systems - networks of plausible inference

  1989cited by this paper
• Uncertainty, belief, and probability

  1989cited by this paper
• Bayesian and Non-Bayesian Evidential Updating

  1987cited by this paper
• A Statistical Viewpoint on the Theory of Evidence

  1986cited by this paper
• On the Desirability of Acyclic Database Schemes

  1983cited by this paper
• Intelligent information systems

  1983cited by this paper
• Normalization and hierarchical dependencies in the relational data model

  1978cited by this paper
• Upper and Lower Probabilities Induced by a Multivalued Mapping

  1967cited by this paper

• No citing papers are available for this paper.