{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0025284450063211127, 'mean_word_length': 5.387096774193548, '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}}
A New Algorithm for Mining Frequent Itemsets from Evidential Databases

Association rule mining (ARM) problem has been extensively tackled in the context of perfect data. However, real applications showed that data are often imperfect (incomplete and/or uncertain) which leads to the need of ARM algorithms that process imperfect databases. In this paper we propose a new algorithm for mining frequent itemsets from evidential databases. We introduce a new structure called RidLists that is the vertical representation of the evidential database. Our structure is adapted to itemsets belief computation which makes the mining algorithm more ecient. Experimental results showed that our proposed algorithm is ecient in comparison with the only evidential ARM algorithm in the literature [10].