{'fraction_non_alphanumeric': 0.018245004344048653, 'fraction_numerical': 0.0, 'mean_word_length': 5.329670329670329, '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}}
Fuzzy decision forest

We investigate the extension of fuzzy decision trees into fuzzy forests. Decision forests attempt to alleviate some problems often associated with decision trees: decision trees are minimalistic in their contained information, and they often degrade in complex domains, when multidimensional relationships are needed, or when there is no preference over similar actions. Moreover, the minimalistic approach often degrades the performance when some necessary features are either missing, noisy, or simply unreliable. These problems have been addressed in the last few years in hybrid systems, in which a number of distinct trees were extracted and used with some voting rules. Fuzzy decision forests follow the same ideas, except that they use more elaborate alternatives specific to local partitioning of the space. Therefore, it is an extension of those hybrid methods. In other words, while in those hybrid systems multiple choices are allowed at the level of the global search space, a fuzzy decision forest allows alternatives at every subspace level. Moreover the choice of available alternatives is data and domain-driven.