Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Tēmu modelēšana× | Dokumentu kopu grupēšana× | Word2Vec× | |
|---|---|---|---|
| Nozare | Teksta ieguve | Teksta ieguve | Teksta ieguve |
| Saime | Process / pipeline | Process / pipeline | Process / pipeline |
| Izcelsmes gads≠ | 2003 | — | 2013 |
| Autors≠ | Blei, Ng & Jordan | — | Tomas Mikolov et al. |
| Tips≠ | Generative probabilistic topic model | Unsupervised text-mining task | Neural word-embedding model |
| Pirmavots≠ | Blei, D.M., Ng, A.Y. & Jordan, M.I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993-1022. link ↗ | Aggarwal, C. C. & Zhai, C. (2012). Mining Text Data. Springer. ISBN: 9781461432227 | Mikolov, T., Chen, K., Corrado, G. & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. link ↗ |
| Citi nosaukumi≠ | LDA, latent Dirichlet allocation, Konu Modelleme — LDA | text clustering, unsupervised text grouping, Belge Kümeleme (Document Clustering) | word embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri |
| Saistītās | 4 | 4 | 4 |
| Kopsavilkums≠ | Latent Dirichlet Allocation (LDA) is a generative probabilistic model introduced by Blei, Ng and Jordan (2003) that extracts the hidden topic distributions underlying a collection of documents. It treats each document as a mixture of latent topics and each topic as a distribution over words, turning an unlabelled corpus into interpretable themes. | Document clustering is an unsupervised text-mining task that groups documents with similar content together without using any labels. It is used to organise large collections and for exploratory analysis, drawing on the body of text-mining techniques consolidated by Aggarwal and Zhai (2012) and compared empirically by Steinbach, Karypis and Kumar (2000). | Word2Vec is a neural word-embedding technique introduced by Mikolov and colleagues in 2013 that maps each word in a text corpus to a dense numeric vector. Words that appear in similar contexts end up close together in the vector space, so the embeddings capture semantic similarity that can be measured arithmetically. |
| ScholarGateDatu kopa ↗ |
|
|
|