{'fraction_non_alphanumeric': 0.018963337547408345, 'fraction_numerical': 0.0, 'mean_word_length': 4.538461538461538, '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}}
Differential Voting in Case Based Spam Filtering

Case-based reasoning (CBR) has been shown to be of considerable utility in a spam-filtering task. In the course of this study, we propose that the non-random skewed distribution of the cases in a case base is crucial, especially in the context of a classification task like spam filtering. In this paper, we propose approaches to improve the performance of a CBR spam filter by making use of the non-random nature of the case base. We associate each case in the case base with a voting power, which is essentially a function that incorporates the knowledge of the local neighborhood of the case. We show that the performance of the spam filter can be considerably improved by making use of such techniques that incorporate the voting powers.