{'fraction_non_alphanumeric': 0.0156794425087108, 'fraction_numerical': 0.0, 'mean_word_length': 5.534090909090909, '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}}
Boosting simple decision trees with Bayesian learning for text categorization

Introduces a Bayesian method to select best base classifiers for a boosting algorithm that is used for solving text categorization problems. This method is specifically shaped for an improved version of AdaBoost.MH, an effective multi-class multi-label text classification algorithm. The paper also proposes a method to facilitate its convergence. Experimental results show that these changes improve not only the accuracy, but also the efficiency of boosting algorithms for text categorization.