विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| कमजोर पर्यवेक्षित एलडीए विषय मॉडल× | अर्ध-पर्यवेक्षित LDA विषय मॉडल× | |
|---|---|---|
| क्षेत्र | गहन अधिगम | गहन अधिगम |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2009–2012 | 2009 |
| प्रवर्तक≠ | Jagarlamudi et al.; Andrzejewski et al. | Ramage, D.; Andrzejewski, D. et al. |
| प्रकार≠ | Probabilistic generative model with weak supervision | Semi-supervised probabilistic topic 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 ↗ | 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 ↗ |
| उपनाम | WS-LDA, Guided LDA, Seeded LDA, Constrained LDA | Labeled LDA, Seeded LDA, Constrained LDA, SS-LDA |
| संबंधित | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|