Many-Class Text Classification with Matching
원문 초록
In this work, we formulate \textbf{T}ext \textbf{C}lassification as a \textbf{M}atching problem between the text and the labels, and propose a simple yet effective framework named TCM. Compared with previous text classification approaches, TCM takes advantage of the fine-grained semantic information of the classification labels, which helps distinguish each class better when the class number is large, especially in low-resource scenarios. TCM is also easy to implement and is compatible with various large pretrained language models. We evaluate TCM on 4 text classification datasets (each with 20+ labels) in both few-shot and full-data settings, and this model demonstrates significant improvements over other text classification paradigms. We also conduct extensive experiments with different variants of TCM and discuss the underlying factors of its success. Our method and analyses offer a new perspective on text classification.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TokenBreak: Bypassing Text Classification Models Through Token Manipulation
Incremental Sequence Classification with Temporal Consistency
Small Language Models in the Real World: Insights from Industrial Text Classification
Token Masking Improves Transformer-Based Text Classification
KDH-MLTC: Knowledge Distillation for Healthcare Multi-Label Text Classification
Towards Robust Few-Shot Text Classification Using Transformer Architectures and Dual Loss Strategies
토론
이 논문과 연결된 포럼 글이 아직 없습니다.