mlsanityData to 7 Oct 2026

Enhancement of Short Text Clustering by Iterative Classification

arXiv 2001.11631 ↗First posted 31 Jan 2020cs.IR cs.CL cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 6; 2022: 3; 2023: 2; 2024: 3; 2025: 1; 2026: 1.

16 papers.

Sort: