%0 Conference Paper %1 Yan2013BTM %A Yan, Xiaohui %A Guo, Jiafeng %A Lan, Yanyan %A Cheng, Xueqi %B Proceedings of the 22nd International Conference on World Wide Web %C New York, NY, USA %D 2013 %I Association for Computing Machinery %K bachelor biterm topicmap %P 1445–1456 %R 10.1145/2488388.2488514 %T A Biterm Topic Model for Short Texts %U https://doi.org/10.1145/2488388.2488514 %X Uncovering the topics within short texts, such as tweets and instant messages, has become an important task for many content analysis applications. However, directly applying conventional topic models (e.g. LDA and PLSA) on such short texts may not work well. The fundamental reason lies in that conventional topic models implicitly capture the document-level word co-occurrence patterns to reveal topics, and thus suffer from the severe data sparsity in short documents. In this paper, we propose a novel way for modeling topics in short texts, referred as biterm topic model (BTM). Specifically, in BTM we learn the topics by directly modeling the generation of word co-occurrence patterns (i.e. biterms) in the whole corpus. The major advantages of BTM are that 1) BTM explicitly models the word co-occurrence patterns to enhance the topic learning; and 2) BTM uses the aggregated patterns in the whole corpus for learning topics to solve the problem of sparse word co-occurrence patterns at document-level. We carry out extensive experiments on real-world short text collections. The results demonstrate that our approach can discover more prominent and coherent topics, and significantly outperform baseline methods on several evaluation metrics. Furthermore, we find that BTM can outperform LDA even on normal texts, showing the potential generality and wider usage of the new topic model. %@ 9781450320351

@inproceedings{Yan2013BTM, abstract = {Uncovering the topics within short texts, such as tweets and instant messages, has become an important task for many content analysis applications. However, directly applying conventional topic models (e.g. LDA and PLSA) on such short texts may not work well. The fundamental reason lies in that conventional topic models implicitly capture the document-level word co-occurrence patterns to reveal topics, and thus suffer from the severe data sparsity in short documents. In this paper, we propose a novel way for modeling topics in short texts, referred as biterm topic model (BTM). Specifically, in BTM we learn the topics by directly modeling the generation of word co-occurrence patterns (i.e. biterms) in the whole corpus. The major advantages of BTM are that 1) BTM explicitly models the word co-occurrence patterns to enhance the topic learning; and 2) BTM uses the aggregated patterns in the whole corpus for learning topics to solve the problem of sparse word co-occurrence patterns at document-level. We carry out extensive experiments on real-world short text collections. The results demonstrate that our approach can discover more prominent and coherent topics, and significantly outperform baseline methods on several evaluation metrics. Furthermore, we find that BTM can outperform LDA even on normal texts, showing the potential generality and wider usage of the new topic model.}, added-at = {2021-06-16T09:58:45.000+0200}, address = {New York, NY, USA}, author = {Yan, Xiaohui and Guo, Jiafeng and Lan, Yanyan and Cheng, Xueqi}, biburl = {https://www.bibsonomy.org/bibtex/203d982f3b988ded8d7a4d6ff69689532/kchoong}, booktitle = {Proceedings of the 22nd International Conference on World Wide Web}, doi = {10.1145/2488388.2488514}, interhash = {42545f0711015ed97fe02d8785625282}, intrahash = {03d982f3b988ded8d7a4d6ff69689532}, isbn = {9781450320351}, keywords = {bachelor biterm topicmap}, location = {Rio de Janeiro, Brazil}, numpages = {12}, pages = {1445–1456}, publisher = {Association for Computing Machinery}, series = {WWW '13}, timestamp = {2021-10-12T20:40:23.000+0200}, title = {A Biterm Topic Model for Short Texts}, url = {https://doi.org/10.1145/2488388.2488514}, year = 2013 }