{'fraction_non_alphanumeric': 0.018536585365853658, 'fraction_numerical': 0.0, 'mean_word_length': 5.75, '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}}
Slant Split Criterion Random Forests Classification Algorithm based on Soft Margin Hyperplane

In order to further to improve the classification accuracy of the random forest algorithm, an Slant Split Criterion Random Forests based on Soft Margin Hyperplane (SSCRF) algorithm is proposed. In the decision tree node splitting process, consider using multiple attribute soft margin hyperplane of the decision tree to replace a single attribute splitting criterion, so that the splitting criterion becomes an inclined hyperplane in the data space, which effectively improves the accuracy of decision tree classification; In order to make the algorithm suitable for multi-classification problems, the "one-to-many" strategy is adopted in the process of node splitting; in the process of transforming into leaf nodes, various adaptive weights are assigned to improve the algorithm's classification ability. The experimental results show that the SSCRF algorithm has higher classification accuracy than the random forest algorithm.