{'fraction_non_alphanumeric': 0.00911854103343465, 'fraction_numerical': 0.0, 'mean_word_length': 4.936936936936937, '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}}
Rough Set Page Recommendation Algorithm Based on Information Entropy

In order to solve the accuracy and speed problems of page recommendation, we used information entropy of data in positive domain to help finding out the rough set rules. A new rough set important attribute mining algorithm based on information entropy is put forward in this paper, according to which a heuristic rules mining algorithm of Web page recommendation is designed. At last we used the recommendation rules to help Web users to find out pages which are interested to them. The experiment results show that the algorithm can improve speed and accuracy of Web page recommendation.