方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 弱监督LDA主题模型× | 弱监督BERT分类× | |
|---|---|---|
| 领域 | 深度学习 | 深度学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2009–2012 | 2017–2020 |
| 提出者≠ | Jagarlamudi et al.; Andrzejewski et al. | Multiple (Ratner et al. for weak supervision framework; Meng et al. for BERT integration) |
| 类型≠ | Probabilistic generative model with weak supervision | Weakly supervised fine-tuning of pre-trained language model |
| 开创性文献≠ | Jagarlamudi, J., Daume III, H., & Udupa, R. (2012). Incorporating Lexical Priors into Topic Models. Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2012), pp. 204–213. link ↗ | Meng, Y., Zhang, Y., Huang, J., Xiong, C., Ji, H., Zhang, C., & Han, J. (2020). Text Classification Using Label Names Only: A Language Model Self-Training Approach. Proceedings of EMNLP 2020, 9006–9017. link ↗ |
| 别名 | WS-LDA, Guided LDA, Seeded LDA, Constrained LDA | WS-BERT, BERT with weak supervision, label-efficient BERT classification, noisy-label BERT fine-tuning |
| 相关 | 6 | 6 |
| 摘要≠ | Weakly Supervised LDA is an extension of Latent Dirichlet Allocation that incorporates lightweight human guidance — typically keyword seeds or must-link/cannot-link constraints — into the Dirichlet priors, steering learned topics toward domain-meaningful themes without requiring fully labeled documents. It sits between fully unsupervised LDA and supervised classification, making it well-suited to situations where labeling thousands of documents is impractical. | Weakly supervised BERT-based classification adapts BERT to text classification tasks when only noisy, heuristic, or programmatically generated labels are available instead of clean human annotations. It combines weak supervision frameworks — such as labeling functions and data programming — with BERT's pre-trained language representations to achieve robust classification without expensive hand-labeling. |
| ScholarGate数据集 ↗ |
|
|