{'fraction_non_alphanumeric': 0.012, 'fraction_numerical': 0.0, 'mean_word_length': 4.825581395348837, '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}}
New explanation of boosting efficiency in classification problem

We study the reasons of high efficiency of methods based on classifiers compositions, such as boosting. It has been shown that one of the main grounds for such efficiency is the usage of the effect of independence of features. To investigate the performance of a method we run it directly on the distributions. We compare approximating capabilities of boosting and splines. Also we show the relation between a complexity and a margin.