Improving Probabilistic Models In Text Classification Via Active Learning

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 for training. 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 with few labeled data, the classification performance of our algorithm is comparable to state-of-the-art methods at a fraction of the computational cost. We replicate the results of two published articles with only a small fraction of the original labeled data used in those studies and provide open-source software to implement our method.

Authors

Institutions

Publication Details

Journal
American Political Science Review
Published
2024-08-05
DOI
https://doi.org/10.1017/s0003055424000716
Citations
1
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving Probabilistic Models In Text Classification Via Active Learning

Saki Kuzushima, Yuki Shiraito, Mitchell Bosley, Ted Enamorado
1 citations
American Political Science Review
Topic Modeling
0.35
article

Improving Probabilistic Models In Text Classification Via Active Learning

Saki Kuzushima, Yuki Shiraito, Mitchell Bosley, Ted Enamorado
article en
1 citations

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 for training. 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 with few labeled data, the classification performance of our algorithm is comparable to state-of-the-art methods at a fraction of the computational cost. We replicate the results of two published articles with only a small fraction of the original labeled data used in those studies and provide open-source software to implement our method.

American Political Science ReviewVol. 119(2)
Harvard University (US), University of Toronto (CA), Washington University in St. Louis (US), University of Michigan (US), United States University (US), Michigan United (US)
Quality Education
Openalex Percentile: Top 35%
Topic Modeling
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Improving Probabilistic Models In Text Classification Via Active Learning — Saki Kuzushima, Yuki Shiraito, et al. · American Political Science Review (2024) | TGRS Research Map | TGRS