Abstract
The danmaku text clustering is a hot topic in online video reviews. Given the problem of unsatisfactory clustering accuracy caused by short text and many new words, the danmaku text clustering algorithm based on feature extension and word-pair filtering OBTM is proposed. First, a new-word discovery algorithm based on weight optimization is proposed to retain the features of new words in the danmaku text. Then, the internal information and external knowledge of new words are used to expand the features of the danmaku text for reduced feature sparsity. Furthermore, the OBTM topic model based on word-pair filtering is designed to eliminate noise features. Finally, the Single-Pass algorithm based on cluster center iteration is proposed to obtain the clustering results of topic feature words. Experimental results show that the algorithm proposed in this paper is 13.33
Keywords
Cite this article
@article{cai-5457,
author = {Di Wu and Zhuyun Huang},
title = {Danmaku Text Clustering Algorithm Based on Feature Extension and Word-Pair Filtering OBTM},
journal = {Computing and Informatics},
volume = {41},
number = {3},
pages = {788--812},
year = {2022},
issn = {1335-9150},
doi = {10.31577/cai_2022_3_788}
}
TY - JOUR AU - Di Wu AU - Zhuyun Huang TI - Danmaku Text Clustering Algorithm Based on Feature Extension and Word-Pair Filtering OBTM JO - Computing and Informatics VL - 41 IS - 3 SP - 788 EP - 812 PY - 2022 SN - 1335-9150 DO - 10.31577/cai_2022_3_788 UR - https://doi.org/10.31577/cai_2022_3_788 KW - Danmaku text KW - short text clustering KW - feature extension KW - OBTM KW - new word discovery ER -
Wu, D., & Huang, Z. (2022). Danmaku Text Clustering Algorithm Based on Feature Extension and Word-Pair Filtering OBTM. Computing and Informatics, 41(3), 788–812. https://doi.org/10.31577/cai_2022_3_788