Improving Short Text Classification with Semi-Supervised Learning
Abstract
Classifying short text poses significant challenges, especially when only a small portion of the data is labeled. Although supervised learning methods can achieve high accuracy on labeled datasets, overfitting often occurs, leading to poor generalization on unseen data. The primary concern is the significant decline in model accuracy when transitioning from a small labeled dataset to a larger set of unlabeled data. To address this issue, the article explores a few strategies: semi-supervised learning, k-means clustering, and stacking of classifiers. Semi-supervised learning leverages both labeled and unlabeled data by iteratively generating pseudo-labels and assigning confidence-based weights, thus expanding the training set without amplifying noise, because greater weight is assigned to more reliable labels. K-means clustering is similarly employed to partition unlabeled data into clusters, and pseudo-labels are inferred via majority voting based on similarity to labeled examples. These augmented methods are shown to mitigate the decline in accuracy observed when transitioning from the small, labeled dataset to previously unseen, unlabeled data. Although stacking multiple classifiers and methods to mitigate imbalanced classes did not improve performance, there are notable mentions and the lack of improvement was likely due to uniformly propagating errors from models that already struggle on unseen samples.
Fields of Study & Subjects
Text and Document Classification Technologies
Machine Learning and Algorithms
Topic Modeling
Publication details
- Journal / source
- TEM Journal
- Pages
- 876–876
- Publication date
- 27 February 2026
- Language
- EN