{'fraction_non_alphanumeric': 0.020320855614973262, 'fraction_numerical': 0.0, 'mean_word_length': 5.591549295774648, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Approximation Of Belief Functions

This paper addresses the approximation of belief functions by probability functions where the approximation is based on minimizing the Euclidean distance. First of all, we simplify this optimization problem so it becomes equivalent to a standard problem in linear algebra. For the simplified optimization problem, we provide the analytic solution. Furthermore, we show that for Dempster-Shafer belief the simplified optimization problem is equivalent to the original one. In terms of semantics, we compare the approximation of belief functions to various alternative approaches, e.g. pignistic transformation for Dempster-Shafer belief and Shapley value for fuzzy belief functions. For the later one, we give an example where the approximation method has some obvious statistical advantages. Additionally, for the approximation of additive belief functions, we can provide a semantical justification.