{'fraction_non_alphanumeric': 0.018726591760299626, 'fraction_numerical': 0.0028089887640449437, 'mean_word_length': 5.073863636363637, '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 Analysis on the Weibo Topic Detection Based on K-means Algorithm

Sina Weibo, as a platform for netizens to express their opinions, generates a large amount of public opinion data and constantly generates new topics. How to detect new and hot topics on Weibo is a meaningful studied issue. Document Clustering is a widely studied problem in Text Categorization. K-means is one of the most famous unsupervised learning algorithms, partitions a given dataset into disjoint clusters following a simple and easy way. But the traditional K-means algorithm assigns initial centroids randomly, which cannot guarantee to choose the maximum dissimilar documents as the centroids for the clusters. A modified K-means algorithm is proposed, which uses Jaccard distance measure for assigning the most dissimilar k documents as centroids, and uses Word2vec as the Chinese text vectorization model. The experimental results demonstrate that the proposed K-means algorithm improves the clustering performance, and is able to detect new and hot topics based on Weibo COVID-19 data.