{'fraction_non_alphanumeric': 0.023032629558541268, 'fraction_numerical': 0.003838771593090211, 'mean_word_length': 4.931818181818182, '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}}
Adapting a Combination Rule to Non-Independent Information Sources

In this article, we address the combination of non-independent sources to solve classification problems, within the theory of belief functions. We show that the cautious rule of combination [1, 2] is wellsuited to such problems. We propose a method to learn the combination rule from training data, and we generalize it in the case of complex dependence of the sources. We demonstrate the validity of our approach on several synthetic and realdata sets.