Coarsening approximations of belief functions

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 362-373

  Ben Yaghlane, Amel ^a   Denœux, Thierry ^b   Mellouli, Khaled ^a  

^a UNIVERSITY OF TUNIS   (Tunisia)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

UNCERTAINTY ANALYSIS;

BELIEF FUNCTION; INFORMATION CONTENTS; OUTER APPROXIMATION; TRANSFORM ALGORITHM;

APPROXIMATION ALGORITHMS;

EID: 84937408775     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. M. Bauer. Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study. International Journal of Approximate Reasoning, 17:217-237, 1997.
2. T. Denæux. Inner and outer clustering approximations of belief structures. In Proceedings of IPMU'2000, volume 1, pages 125-132, Madrid, July 2000.
3. D. Dubois and H. Prade. Representation and combination of uncertainty with belief functions and possibility measures. Comput. Intell., 4:244-264, 1988.
4. D. Dubois and H. Prade. Consonant approximations of belief measures. International Journal of Approximate Reasoning, 4:419-449, 1990.
5. D. Harmanec. Faithful approximations of belief functions. In K. B. Laskey and H. Prade, editors, Uncertainty in Artificial Intelligence 15 (UAI99), Stockholm, Sweden, 1999.
6. Lowrance J. D, T. D. Garvey, and T. M. Strat. A framework for evidentialreasoning systems. In T. Kehler et al., editor, Proceedings of AAAI'86, volume 2, pages 896-903, Philadelphia, August 1986. AAAI.
7. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, Englewood Cliffs, NJ., 1988.
8. R. Kennes. Computational aspects of the Möbius transform of graphs. IEEE Trans. SMC, 22:201-223, 1992.
9. G. J. Klir and M. J. Wierman. Uncertainty-Based Information. Elements of Generalized Information Theory. Springer-Verlag, New-York, 1998.
10. P. Orponen. Dempster's rule of combination is # p-complete. Artificial Intelligence, 44:245-253, 1990.
11. S. Petit-Renaud and T. Denæux. Handling different forms of uncertainty in regression analysis: A fuzzy belief structure approach. In A. Hunter and S. Pearsons, editors, Symbolic and quantitative approaches to reasoning and uncertainty (ECSQARU' 99), pages 340-351, London, June 1999. Springer Verlag.
12. G. Shafer. A mathematical theory of evidence. Princeton University Press, Princeton, N.J., 1976.
13. P. Smets. The Transferable Belief Model for quantified belief representation. In D. M. Gabbay and P. Smets, editors, Handbook of Defeasible reasoning and uncertainty management systems, volume 1, pages 267-301. Kluwer Academic Publishers, Dordrecht, 1998.
14. P. Smets. Practical uses of belief functions. In K. B. Laskey and H. Prade, editors, Uncertainty in Artificial Intelligence 15 (UAI99), pages 612-621, Stockholm, Sweden, 1999.
15. B. Tessem. Approximations for efficient computation in the theory of evidence. Artificial Intelligence, 61:315-329, 1993.
16. N. Wilson. Algorithms for dempster-shafer theory. In D. M. Gabbay and P. Smets, editors, Hanbook of defeasible reasoning and uncertainty management. Volume 5: Algorithms for Uncertainty and Defeasible Reasoning, pages 421-475. Kluwer Academic Publishers, Boston, 2000.