Clustering massive text data streams by semantic smoothing model

7Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organization and topic detection and tracing etc. However, most methods are similarity-based approaches and use the TF*IDF scheme to represent the semantics of text data and often lead to poor clustering quality. In this paper, we firstly give an improved semantic smoothing model for text data stream environment. Then we use the improved semantic model to improve the clustering quality and present an online clustering algorithm for clustering massive text data streams. In our algorithm, a new cluster statistics structure, cluster profile, is presented in which the semantics of text data streams are captured. We also present the experimental results illustrating the effectiveness of our technique. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Liu, Y., Cai, J., Yin, J., & Fu, A. W. C. (2007). Clustering massive text data streams by semantic smoothing model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4632 LNAI, pp. 389–400). Springer Verlag. https://doi.org/10.1007/978-3-540-73871-8_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free