{'fraction_non_alphanumeric': 0.02346805736636245, 'fraction_numerical': 0.0, 'mean_word_length': 5.347107438016529, '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}}
Fast heterogeneous boosting

The main goal of this paper is introduction of fast heterogeneous boosting algorithm. `Heterogeneous' means that boosting is based not on single-type learning machine, but may use machines of several types coherently. The main idea behind the construction of heterogeneous boostings was to use it with learning machines of low complexity (O(nd)). Thanks to that, the heterogeneous boosting is still a fast algorithm of linear learning (and usage) complexity. The paper presents a comparison of homogeneous boostings of a few types of fast learning machines with introduced heterogeneous boosting, which base on a small group of fast learning machines. The presented comparison proves that heterogeneous boosting is efficient and accurate.