{'fraction_non_alphanumeric': 0.03428571428571429, 'fraction_numerical': 0.0, 'mean_word_length': 4.890756302521009, '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}}
From descriptor to boosting: Optimizing the k-NN classification rule

The k-nearest neighbor (K-NN) framework was successfully used for tasks of computer vision. In image categorization, k-NN is an important and significant rule. However, two major problems usually affect this rule: the NN classifier vote and the metric employed to compute the distance between neighbors. This paper deals with both. First, a boosting k-NN algorithm learns the coefficients of weak classifiers, hence allowing to assign weights for k-NN votes. Second, we have recourse to metric learning: a function is trained on sets of similar and dissimilar samples to increase inter-class distances and reduce intra-class ones.