{'fraction_non_alphanumeric': 0.021464646464646464, 'fraction_numerical': 0.0, 'mean_word_length': 5.2936507936507935, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Conditional Events, Conditioning, and Random Sets

A central problem in the Dempster/Shafer theory of evidence is conditioning. This paper presents a new approach to a solution of this problem by establishing a link between conditional events and discrete random sets. Conditional events are introduced as sets of equivalent events under conditioning. These sets may become targets of a multivalued mapping. Thus, conditional belief functions can be introduced. Both Bayesian and pure random set conditioning rules are derived and discussed. Random set conditioning allows expressing conditional degrees of belief when marginal beliefs are unknown. Finally, an updating rule is introduced that is equivalent to the law of total probability (Jeffrey's rule) if all beliefs are probabilities. >