{'fraction_non_alphanumeric': 0.016483516483516484, 'fraction_numerical': 0.0, 'mean_word_length': 5.544910179640719, '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}}
Applying a Novel Combined Classifier for Hypertext Classification in Pornographic Web Filtering

As the Web expands exponentially, there are a flood of pornographic Web sites on the Internet. Thus effective Web filtering systems are essential. Web filtering based on hypertext classification has become one of the important techniques to handle and filter inappropriate information on the Web. Hypertext classification, that is the automatic classification of Web documents into predefined classes, came to elevate humans from that task. However, how to improve the performance of the hypertext classification under the situation of noisy data is still a challenging problem. In this paper, we propose a new approach for hypertext classification in Web filtering, which uses a novel support vector machine and K-nearest neighbor (KNN-SVM) to remove noisy training examples. The experimental results show that the generalization performance and the accuracy of classification are improved significantly compared to that of the traditional SVM classifier, and adapt to engineering applications.