{'fraction_non_alphanumeric': 0.014821272885789015, 'fraction_numerical': 0.0, 'mean_word_length': 5.674418604651163, '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}}
An active MBBNTree classifier learning from unlabeled samples

Obtaining labeled training examples for some classification tasks is often expensive, such as text classification, mail filtering, while gathering large quantities of unlabeled examples is usually very cheap. Active learning aims at reducing the number of training examples to be labeled by automatically processing the unlabeled examples, then selecting the most informative ones with respect to a given cost function for a human to label. MBBNTree algorithm, which integrates the advantage of Markov Blanket Bayesian Networks (MBBN) and Decision Tree, would behave better performance than other Bayesian Networks for classification. But the available training samples with actual classes are not enough for building MBBNTree classifier in practice. In this paper, the MBBNTree classifier algorithm based on the Query-by-Committee of active learning would be presented to solve the problem of learning MBBNTree classifier from unlabeled samples. Experimental results show that the proposed algorithm can reach the same accuracy as passive learning with few labeled training examples.