Journal
ANNALS OF OPERATIONS RESEARCH
Volume 195, Issue 1, Pages 135-161Publisher
SPRINGER
DOI: 10.1007/s10479-011-0887-2
Keywords
Belief functions; Dempster-Shafer theory; Evidence theory; Lattices; Lattice intervals; Classification; Clustering; Learning; Preference relation; Preorder
Categories
Ask authors/readers for more resources
The Dempster-Shafer theory of belief functions has proved to be a powerful formalism for uncertain reasoning. However, belief functions on a finite frame of discernment Omega are usually defined in the power set 2(Omega), resulting in exponential complexity of the operations involved in this framework, such as combination rules. When Omega is linearly ordered, a usual trick is to work only with intervals, which drastically reduces the complexity of calculations. In this paper, we show that this trick can be extrapolated to frames endowed with an arbitrary lattice structure, not necessarily a linear order. This principle makes it possible to apply the Dempster-Shafer framework to very large frames such as the power set, the set of partitions, or the set of preorders of a finite set. Applications to multi-label classification, ensemble clustering and preference aggregation are demonstrated.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available