{'fraction_non_alphanumeric': 0.01761006289308176, 'fraction_numerical': 0.0, 'mean_word_length': 5.524590163934426, '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}}
Minimum Spanning Tree Support Vector Machine Based on Fisher Separability Measure

Classification strategy is an important issue of support vector machine application. Aiming at the defects of common used classification methods, an improved minimum spanning tree support vector machine (MST-SVM) is proposed. MST-SVM has the advantages of simple structure and high classification efficiency. The classification process is further optimized by introduction of Fisher separability measure in feature space, and the classification performance is improved. The construction process of MST-SVM is given in this paper, the effectiveness and generality of the new method are proved by contrast experiment on the standard data sets, and the application value is proved by analog circuit fault diagnosis.