{'fraction_non_alphanumeric': 0.01867816091954023, 'fraction_numerical': 0.0, 'mean_word_length': 5.168141592920354, '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}}
Sparse Support Vector Machine for pattern recognition

Support Vector Machine (SVM) is one of the most famous classification techniques in the pattern recognition community. However, due to outliers in the training samples, the SVM tend to be over-trained. This means that the generalization ability of the SVM will decrease for further training. In this paper, we borrow the idea of compressive sensing/sparse representation and apply it to the SVM. Our method can achieve higher classification rates than the standard SVM due to the sparser support vectors. Experimental results conducted in this paper show that our proposed technique is feasible in practical pattern recognition applications.