2018 · 67 citations · 28 references
ComputingComputer ScienceData ScienceData MiningMachine LearningNatural Language ProcessingDocument ClusteringScalable Data MiningStream ProcessingStreaming AlgorithmsText ClusteringText MiningClustering Of Short TextsConcept DriftData SparsityData Stream MiningSparsity ProblemStream MiningStreaming ClusteringStreaming Data Mining
Short text stream clustering has become an increasingly important problem due to the explosive growth of short text in diverse social medias. In this paper, we propose a model-based short text stream clustering algorithm (MStream) which can deal with the concept drift problem and sparsity problem naturally. The MStream algorithm can achieve state-of-the-art performance with only one pass of the stream, and can have even better performance when we allow multiple iterations of each batch. We further propose an improved algorithm of MStream with forgetting rules called MStreamF, which can efficiently delete outdated documents by deleting clusters of outdated batches. Our extensive experimental study shows that MStream and MStreamF can achieve better performance than three baselines on several real datasets.
28
Data clustering: 50 years beyond K-means
Anil K. Jain · Pattern Recognition Letters · 2009 · 9.2K citations
A vector space model for automatic indexing
Gerard Salton, Anita M.-Y. Wong, Chul‐Su Yang · Communications of the ACM · 1975 · 7.4K citations · Full text
A Bayesian Analysis of Some Nonparametric Problems
Thomas S. Ferguson · The Annals of Statistics · 1973 · 4.8K citations · Full text
Text Classification from Labeled and Unlabeled Documents using EM
Kamal Nigam, Andrew Kachites McCallum, Sebastian Thrun et al. · Machine Learning · 2000 · 2.7K citations · Full text