Completely monotone outer approximations of lower probabilities on finite possibility spaces

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

Drawing inferences from general lower probabilities on finite possibility spaces usually involves solving linear programming problems. For some applications this may be too computationally demanding. Some special classes of lower probabilities allow for using computationally less demanding techniques. One such class is formed by the completely monotone lower probabilities, for which inferences can be drawn efficiently once their Möbius transform has been calculated. One option is therefore to draw approximate inferences by using a completely monotone approximation to a general lower probability; this must be an outer approximation to avoid drawing inferences that are not implied by the approximated lower probability. In this paper, we discuss existing and new algorithms for performing this approximation, discuss their relative strengths and weaknesses, and illustrate how each one works and performs.

Original languageEnglish
Title of host publicationNonlinear Mathematics for Uncertainty and its Applications
EditorsShoumei Li, Li Guan, Xia Wang, Yoshiaki Okazaki, Jun Kawabe, Toshiaki Murofushi
Pages169-178
Number of pages10
DOIs
Publication statusPublished - 2011
Externally publishedYes

Publication series

NameAdvances in Intelligent and Soft Computing
Volume100
ISSN (Print)1867-5662

Keywords

  • Belief functions
  • Complete monotonicity
  • lower probabilities
  • Möbius transform
  • Outer approximation

Fingerprint Dive into the research topics of 'Completely monotone outer approximations of lower probabilities on finite possibility spaces'. Together they form a unique fingerprint.

Cite this