Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Model de Topic cu Alocare Dirichlet Slab Supervizată× | Modelare de subiecte LDA semi-supervizată× | |
|---|---|---|
| Domeniu | Învățare profundă | Învățare profundă |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2009–2012 | 2009 |
| Autorul original≠ | Jagarlamudi et al.; Andrzejewski et al. | Ramage, D.; Andrzejewski, D. et al. |
| Tip≠ | Probabilistic generative model with weak supervision | Semi-supervised probabilistic topic model |
| Sursa seminală≠ | 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 ↗ | Ramage, D., Hall, D., Nallapati, R., & Manning, C. D. (2009). Labeled LDA: A supervised topic model for credit attribution in multi-labeled corpora. Proceedings of EMNLP, 248–256. link ↗ |
| Denumiri alternative | WS-LDA, Guided LDA, Seeded LDA, Constrained LDA | Labeled LDA, Seeded LDA, Constrained LDA, SS-LDA |
| Înrudite | 6 | 6 |
| Rezumat≠ | 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. | Semi-supervised LDA extends standard Latent Dirichlet Allocation by incorporating a small amount of supervision — seed words, labeled documents, or must-link/cannot-link word constraints — to guide topic discovery toward semantically coherent, interpretable themes. It bridges unsupervised topic modeling and fully supervised text classification, making it especially valuable when full annotation is costly. |
| ScholarGateSet de date ↗ |
|
|