Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Тематична модель LDA× | Векторні представлення речень× | |
|---|---|---|
| Галузь | Глибоке навчання | Глибоке навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2003 | 2015–2019 |
| Автор методу≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. | Kiros et al. (Skip-Thought, 2015); Reimers & Gurevych (Sentence-BERT, 2019) |
| Тип≠ | Probabilistic generative topic model | Representation learning / embedding |
| Основоположне джерело≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ | Reimers, N., & Gurevych, I. (2019). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3980–3990. DOI ↗ |
| Інші назви | LDA, Latent Dirichlet Allocation, LDA Topic Modeling, Dirichlet Topic Model | sentence vectors, sentence representations, SBERT, semantic sentence encoding |
| Пов'язані≠ | 5 | 4 |
| Підсумок≠ | Latent Dirichlet Allocation (LDA) is a probabilistic generative model introduced by Blei, Ng, and Jordan in 2003 that discovers hidden thematic structure in large text collections by representing each document as a mixture of latent topics and each topic as a probability distribution over vocabulary words. | Sentence Embeddings convert a sentence or short text into a single fixed-length dense vector that captures its semantic meaning. These vectors allow downstream tasks — semantic similarity, clustering, retrieval, and classification — to operate on numerical representations instead of raw text, making them one of the most versatile building blocks in modern NLP pipelines. |
| ScholarGateНабір даних ↗ |
|
|