{'fraction_non_alphanumeric': 0.02280130293159609, 'fraction_numerical': 0.0, 'mean_word_length': 5.22972972972973, '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}}
Efficient Computing of Dempster-Shafer Theoretic Conditionals for Big Hard/Soft Data Fusion

Ahstract- While hard sensor fusion is a highly developed discipline with vast methods, the inclusion of soft evidence continues to gain significant interest because soft sensors in the fusion process has certain merits, such as the ability to model attributes of interest (e.g., emotional level) that hard sensor may not. However, how to combine the hard/soft sensor data efficiently is a challenging problem, especially when the data set becomes large. In this study, a novel algorithm is proposed to apply the Conditional Core Theorem (CCT) in computing the Fagin-Halpern conditionals in the fusion of bodies of evidence with disparate frames of discernment. The computational complexity of the proposed algorithm is derived analytically and simulations are carried out to demonstrate the efficiency of the proposed algorithm.