{'fraction_non_alphanumeric': 0.02425876010781671, 'fraction_numerical': 0.0, 'mean_word_length': 5.81651376146789, '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}}
Efficient geometric algorithms for support vector machine classifier

The geometric approaches based on reduced convex hull (RCH) are promising methods for solving support vector machine (SVM), which have been the focus of intense theoretical as well as application-oriented research in machine learning. In this paper, two efficient geometric learning algorithms for SVM, termed as DNP-GA and PDNP-GA, are proposed by introducing the direct nearest point-pair and probabilistic speed-up strategies. Extensive experiments on several artificial and benchmark databases have been conducted to show that, compared with the corresponding geometric algorithm, the proposed algorithms degrade many kernel evaluations without loss of generalization.