Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5590))

  • 1238 Accesses

Abstract

In this paper we discuss the problem of approximating a belief function (b.f.) with a necessity measure or “consonant belief function” (co.b.f.) from a geometric point of view. We focus in particular on outer consonant approximations, i.e. co.b.f.s less committed than the original b.f. in terms of degrees of belief. We show that for each maximal chain of focal elements the set of outer consonant approximation is a polytope. We describe the vertices of such polytope, and characterize the geometry of maximal outer approximations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Smets, P.: The Transferable Belief Model. Artificial Intelligence 66 (1994)

    MATH  Google Scholar 

  2. Dubois, D., Prade, H.: Possibility theory. Plenum Press, New York (1988)

    Book  MATH  Google Scholar 

  3. Dubois, D., Prade, H.: Consonant approximations of belief functions. International Journal of Approximate Reasoning 4, 419–449 (1990)

    Article  MATH  Google Scholar 

  4. Joslyn, C., Klir, G.: Minimal information loss possibilistic approximations of random sets. In: Bezdek, J. (ed.) Proc. 1992 FUZZ-IEEE Conference, pp. 1081–1088 (1992)

    Google Scholar 

  5. Joslyn, C.: Possibilistic normalization of inconsistent random intervals. Advances in Systems Science and Applications, 44–51 (1997)

    Google Scholar 

  6. Baroni, P.: Extending consonant approximations to capacities. In: Proceedings of IPMU, pp. 1127–1134 (2004)

    Google Scholar 

  7. Smets, P.: The transferable belief model and possibility theory. In: Kodratoff, Y. (ed.) Proceedings of NAFIPS 1990, pp. 215–218 (1990)

    Google Scholar 

  8. Cuzzolin, F.: Simplicial complexes of finite fuzzy sets. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty IPMU 2004, Perugia, Italy, pp. 1733–1740 (2004)

    Google Scholar 

  9. Joslyn, C.: Towards an empirical semantics of possibility through maximum uncertainty. In: Lowen, R., Roubens, M. (eds.) Proc. IFSA 1991, vol. A, pp. 86–89 (1991)

    Google Scholar 

  10. Dubrovin, B.A., Novikov, S.P., Fomenko, A.T.: Sovremennaja geometrija. Metody i prilozenija, Nauka, Moscow (1986)

    Google Scholar 

  11. Dubois, D., Prade, H.: A set-theoretic view of belief functions: Logical operations and approximation by fuzzy sets. Int. J. of General Systems 12(3), 193–226 (1986)

    Article  Google Scholar 

  12. Cuzzolin, F.: The geometry of consonant belief functions: simplicial complexes of necessity measures (in preparation) (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cuzzolin, F. (2009). Complexes of Outer Consonant Approximations. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02906-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02905-9

  • Online ISBN: 978-3-642-02906-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics