{'fraction_non_alphanumeric': 0.013714285714285714, 'fraction_numerical': 0.0, 'mean_word_length': 4.688311688311688, '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}}
An Algorithm of LDA Topic Reduction Based on Rough Set

The topic model LDA can uncover latent topics in text mining, through the probability distribution of words in the text to get the distribution of topics. This approach ignores the correlation between the topics, so in some actual domain it is not enough to reflect the real situations of the topics. We can divide the topics into two classes: key topics and unimportant topics. The key topics can reflect the word attributes well, and other topics can be look as subordinate. Considering the relations of the topics, a topic reduction algorithm is proposed to retain the key topics and delete the redundant topics based on rough set. Because the LDA topics exists uncertainty distribution and rough set can deal with uncertain data well, so the algorithm based on rough set can improve the accuracy of topics analysis.