{'fraction_non_alphanumeric': 0.015853658536585366, 'fraction_numerical': 0.0, 'mean_word_length': 5.4140625, '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}}
A Method for Rapid Feature Extraction Based on KMSE

Kernel minimum squared error (KMSE) is a mathematically tractable feature extraction method in comparison with other nonlinear methods. However, as a kernel method, it also suffers from the drawback that the classification efficiency decreases as the size of the training samples increases. In order to improve the KMSE-based classification efficiency, we propose to approximate the discriminant vector in the feature space using a certain linear combination of some samples selected from the set of the training samples. Based on this idea, we develop an algorithm to determine the samples, and a linear combination of which can approximately express the genuine discriminant vector. Experiments on benchmark dataset illustrate the effectiveness of the improvements.