{'fraction_non_alphanumeric': 0.015151515151515152, 'fraction_numerical': 0.0, 'mean_word_length': 5.565217391304348, '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}}
Automated text categorization by generalized kernel machines

Text categorization refers to the task of designing methods to automatically classify text documents into different groups. With wide applications in intelligent information processing, it has attracted much recent research attention. The classical support vector machines (SVM) algorithm has obtained significant success on this task. Inspired by the achievements of SVM, a family of related kernel methods is being widely studied. This paper investigates a novel kernel method for text categorization. Different from SVM and related approaches which operate on thousands of word term features of text corpus, our method takes concept features into consideration as well. We use a generalized regularizer which leaves concept features unregularized. With a squared-loss function to measure the empirical error, the method has a simple convex solution. In real evaluations we have verified both the effectiveness and the efficiency of the method in benchmarked text categorization applications.