方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 主题建模× | 文档聚类× | |
|---|---|---|
| 领域 | 文本挖掘 | 文本挖掘 |
| 方法族 | 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数据集 ↗ |
|
|