Hierarchical proportional redistribution for bba approximation

Advances in Intelligent and Soft Computing

Volumn 164 AISC, Issue , 2012, Pages 275-283

  Dezert, Jean ^a   Han, Deqiang ^b   Liu, Zhunga ^c   Tacnet, Jean Marc ^d  

^a ONERA   (France)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^d Cemagref   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION APPROACH; BASIC BELIEF ASSIGNMENT; BELIEF FUNCTION; COMPUTATIONAL COSTS; DEMPSTER'S RULE OF COMBINATION; NON-SPECIFICITY;

SOFT COMPUTING; SOFTWARE ENGINEERING;

UNCERTAINTY ANALYSIS;

EID: 84860990456     PISSN: 18675662     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-29461-7_32     Document Type: Conference Paper

References (13)

1. Barnett, J.A.: Computational methods for a mathematical theory of evidence. In: Proceedings of IJCAI 1981, Vancouver, pp. 868-875 (1981)
2. Burger, T., Cuzzolin, F.: The barycenters of the k-additive dominating belief functions and the pignistic k-additive belief functions. In: Workshop on Theory of Belief Functions, Brest, France, pp. 1-6 (2010)
3. Denoeux, T.: Inner and outer approximation of belief structures using a hierarchical clustering approach. International Journal of Uncertainty, Fuzziness, and Knowledge-based Systems 9, 437-460 (2001)
4. Dubois, D., Prade, H.: A note on measures of specificity for fuzzy sets. International Journal of General Systems 10, 279-283 (1985)
5. Dubois, D., Prade, H.: An alternative approach to the handling of subnormal possiblity distributions. Fuzzy Sets and Systems 24, 123-126 (1987)
6. Grabisch, M.: Upper approximation of non-additive measures by k-additive measures - the case of belief functions. In: Proc. of the 1st Int. Symposium on Imprecise Probabilities and Their Applications, Ghent, Belgium (1999)
7. Jousselme, A.-L., Maupin, P.: Distances in evidence theory: Comprehensive survey and generalizations. International Journal of Approximate Reasoning 53, 118-145 (2011)
8. Kennes, R.: Computational aspects of the Möbius transform of graphs. IEEE Transactions on SMC 22, 201-223 (1992)
9. Moral, S., Salmerón, A.: A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation. In: Hunter, A., Parsons, S. (eds.) EC-SQARU 1999. LNCS (LNAI), vol. 1638, pp. 305-315. Springer, Heidelberg (1999)
10. Shafer, G.: A Mathematical Theory of Evidence. Princeton University, Princeton (1976)
11. Smets, P.: Practical uses of belief functions. In: Lskey, K.B., Prade, H. (eds.) Uncertainty in Artificial Intelligence 15 (UAI 1999), Stockholm, Sweden, pp. 612-621 (1999)
12. Tessem, B.: Approximations for efficient computation in the theory of evidence. Artificial Intelligence 61, 315-329 (1993)
13. Voorbraak, F.: A computationally efficient approximation of Dempster-Shafer theory. Int. J. Man-Machine Studies 30, 525-536 (1989)