{'fraction_non_alphanumeric': 0.032989690721649485, 'fraction_numerical': 0.005154639175257732, 'mean_word_length': 4.884848484848485, '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}}
Tree-Structured Learning of Multi-class SVMs with Triple Learning Units

To reduce the computational complexity of multi-class SupportVector Machines (SVM), this paper presents a multi-class algorithm in which a triple classifier is included as a second learning unit. This triple learning unit is a regression model for three classes and is based on Least-Squares SVMs (LS-SVMs). To train the triple learning unit, binary target values are first expanded with a third optional output, then an advanced LS-SVM algorithm is used to guarantee the sparseness of the solution. An ensemble of all learning units are placed at nodes of a Directed Decision Tree(DDT), leading to proposal of a Directed Decision Tree SVM (DDTSVM). DDTSVMs can improve the learning efficiency in classifying unlabelled data, a drawback for both 1-v-r and 1-v-1methods. Empirical studies show that the proposed DDTSVM achieves excellent classification accuracy in comparison with the 1-v-1 method.