{'fraction_non_alphanumeric': 0.021372328458942633, 'fraction_numerical': 0.0, 'mean_word_length': 5.3120567375886525, '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}}
Chinese Web page classification using noise-tolerant support vector machines

Real-world applications often require the classification of Web documents under the situation of noisy data. Support vector machines (SVM) work well for classification applications because of their high generalization ability. But they are very sensitive to noisy training data, which can degrade their classification accuracy. This paper presents a new algorithm to deal with noisy training data, which combines support vector machines and K-nearest neighbor (KNN) method. Given a training set, it employs K-nearest neighbor method to remove noisy training examples. Then the remained examples are selected to train SVM classifiers for Web categorization. Empirical results show that this new algorithm has strong tolerance of noise, and it can greatly reduce the influence of noisy data on the SVM classifier.