Algebraic structure of the families of compatible frames of discernment

Authors:
Fabio Cuzzolin
Affiliations:
Computer Science Department, University of California at Los Angeles, Los Angeles, USA 90095-1596
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2005

Citing 4
Cited 0

Strongness in semimodular lattices

Discrete Mathematics
Combining belief functions when evidence conflicts

Decision Support Systems
Uncertainty Models for Knowledge-Based Systems; A Unified Approach to the Measurement of Uncertainty

Uncertainty Models for Knowledge-Based Systems; A Unified Approach to the Measurement of Uncertainty
A Study of Probabilities and Belief Functions under Conflicting Evidence: Comparisons and New Methods

IPMU '90 Proceedings of the 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems: Uncertainty in Knowledge Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the major ideas of Shafer's mathematical theory of evidence is the introduction of uncertainty descriptions on different representation domains of phenomena, called families of compatible frames of discernment. Here we are going to analyze these families of frames from an algebraic point of view, study the properties of minimal refinements of collections of domains and introduce the internal operation of maximal coarsening to establish the structure of semimodular lattice. Motivated by the search for a solution of the conflict problem that arises in sensor fusion applications, we will show the connection between classical independence of frames as Boolean subalgebras and independence of frames as elements of a locally finite Birkhoff lattice. This will eventually suggest a potential algebraic solution of the conflict problem.