Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improving Probabilistic Models in Text Classification via Active Learning (2202.02629v2)

Published 5 Feb 2022 in cs.CL, stat.AP, and stat.ME

Abstract: Social scientists often classify text documents to use the resulting labels as an outcome or a predictor in empirical research. Automated text classification has become a standard tool, since it requires less human coding. However, scholars still need many human-labeled documents to train automated classifiers. To reduce labeling costs, we propose a new algorithm for text classification that combines a probabilistic model with active learning. The probabilistic model uses both labeled and unlabeled data, and active learning concentrates labeling efforts on difficult documents to classify. Our validation study shows that the classification performance of our algorithm is comparable to state-of-the-art methods at a fraction of the computational cost. Moreover, we replicate two recently published articles and reach the same substantive conclusions with only a small proportion of the original labeled data used in those studies. We provide activeText, an open-source software to implement our method.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Mitchell Bosley (1 paper)
  2. Saki Kuzushima (2 papers)
  3. Ted Enamorado (1 paper)
  4. Yuki Shiraito (5 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.