{'fraction_non_alphanumeric': 0.0244140625, 'fraction_numerical': 0.0087890625, 'mean_word_length': 4.959302325581396, '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}}
Test feature classifiers: performance and applications

In this paper, we present a class of test feature classifiers (TFCs). We discuss the properties and performance of the proposed classifiers and describe cases when a 100% recognition rate on test data can be achieved. When the number of features increases, classes having no more than a polynomial number of instances (in the number of features) are the only cases possible to process. We prove that for almost all pairs of classes with a polynomial number of instances, a 100% recognition rate on any test data can be achieved. To test the performance of the classifiers, we apply them to both artificial and real data. For the real data, we use the well known breast cancer, phoneme, and satimage databases, which are recognized to be difficult classification problems. Our experimental results show that the proposed classifiers not only have a high recognition ability but, also, the ability to achieve a 100% recognition rate in difficult classification problems.