השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| מידול נושאים× | מיון מסמכים× | |
|---|---|---|
| תחום | כריית טקסט | כריית טקסט |
| משפחה | Process / pipeline | Process / pipeline |
| שנת המקור≠ | 2003 | — |
| הוגה השיטה≠ | Blei, Ng & Jordan | — |
| סוג≠ | Generative probabilistic topic model | Unsupervised text-mining task |
| מקור מכונן≠ | 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 |
| כינויים | LDA, latent Dirichlet allocation, Konu Modelleme — LDA | text clustering, unsupervised text grouping, Belge Kümeleme (Document Clustering) |
| קשורות | 4 | 4 |
| תקציר≠ | 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). |
| ScholarGateמערך נתונים ↗ |
|
|