IRCLLGJan 31, 2020

Enhancement of Short Text Clustering by Iterative Classification

arXiv:2001.11631v150 citations
AI Analysis

This addresses the challenge of clustering short texts, which have limited signal, for applications in text analysis, but it is incremental as it builds on existing clustering algorithms.

The paper tackles the problem of short text clustering by proposing an iterative classification method that removes outliers and retrains a classifier to improve clustering quality, resulting in statistically significant outperformance over state-of-the-art methods on several datasets.

Short text clustering is a challenging task due to the lack of signal contained in such short texts. In this work, we propose iterative classification as a method to b o ost the clustering quality (e.g., accuracy) of short texts. Given a clustering of short texts obtained using an arbitrary clustering algorithm, iterative classification applies outlier removal to obtain outlier-free clusters. Then it trains a classification algorithm using the non-outliers based on their cluster distributions. Using the trained classification model, iterative classification reclassifies the outliers to obtain a new set of clusters. By repeating this several times, we obtain a much improved clustering of texts. Our experimental results show that the proposed clustering enhancement method not only improves the clustering quality of different clustering methods (e.g., k-means, k-means--, and hierarchical clustering) but also outperforms the state-of-the-art short text clustering methods on several short text datasets by a statistically significant margin.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes