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 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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ICS: Total Freedom in Manual Text Classification Supported by Unobtrusive Machine Learning
TokenBreak: Bypassing Text Classification Models Through Token Manipulation
AdaptText: A Novel Framework for Domain-Independent Automated Sinhala Text Classification
A Method for MBTI Classification Based on Impact of Class Components
Targeted Data-driven Regularization for Out-of-Distribution Generalization
Making Language Model a Hierarchical Classifier and Generator
토론
이 논문과 연결된 포럼 글이 아직 없습니다.