{'fraction_non_alphanumeric': 0.02185792349726776, 'fraction_numerical': 0.0036429872495446266, 'mean_word_length': 4.908602150537634, '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 two-stage classification method for vector pattern matching problems

In this paper, we propose a new method to classify unknown objects into a large number of possible patterns (classes) and thereby solve vector-matching problems. The core of this method is a learning mechanism that reduces a huge amount of training samples into a highly condensed set of templates. When used in a testing process, these templates hold target patterns within the nearest K templates for almost all unknown objects, where K is a small number (2 or 3, for example). This learning mechanism also produces an extremely small set of confusing pairs, in opposition to all N(N-1)/2 possible pairs, where N is the total number of patterns. These pairs are further processed by a disambiguation procedure that improves the overall performance of the pattern classifier. This learning method thus suggests a two-stage online process for classifying unknown objects. The first stage reduces the number of possible candidates to a few candidates and the second stage identifies the target patterns out of these candidates.