{'fraction_non_alphanumeric': 0.02046783625730994, 'fraction_numerical': 0.0029239766081871343, 'mean_word_length': 4.756302521008403, '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}}
Generalizing the majority voting scheme to conditional voting

In this paper we propose a new voting scheme for generalizing the classical majority voting system. In contrast to the classical voting method we can make good decision if the number of classifiers assigning the correct class label is less than the half of the overall number of classifiers. This new method can be applied to such problems when the decision is not only logical but is also required to satisfy a pre-defined (e. g. geometrical) condition. In addition, we will show the results corresponding to the concept of pattern of success and failure using the existence theorem for the combinatorial (0,1)-matrices.