Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Samoučící se LDA model témat× | Model témat NMF× | |
|---|---|---|
| Obor | Hluboké učení | Hluboké učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2003 (LDA); self-supervised variants from 2020 | 1999 |
| Tvůrce≠ | Blei, D. M., Ng, A. Y., Jordan, M. I. (LDA); self-supervised extension by multiple authors (2020s) | Lee, D. D. & Seung, H. S. |
| Typ≠ | Probabilistic generative model with self-supervised pretraining | Matrix factorization / unsupervised topic model |
| Původní zdroj≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ | Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791. DOI ↗ |
| Další názvy | SSL-LDA, self-supervised topic modeling, self-supervised LDA, contrastive LDA | NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model |
| Příbuzné≠ | 6 | 4 |
| Shrnutí≠ | Self-supervised LDA combines the probabilistic generative framework of Latent Dirichlet Allocation with self-supervised pretraining signals — such as masked-word prediction or contrastive document objectives — to guide topic discovery without requiring hand-labeled training data. The result is topic representations that are simultaneously grounded in distributional statistics and enriched by language structure learned from raw text. | Non-negative Matrix Factorization (NMF) is an unsupervised matrix decomposition method that discovers latent topics in a text corpus by factoring a document-term matrix into two non-negative matrices — one encoding topic-word weights, the other document-topic weights. The non-negativity constraint yields parts-based, additive representations that tend to produce clean, interpretable topics. |
| ScholarGateDatová sada ↗ |
|
|