قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| تجميع العنقودية باستخدام المتوسطات (K-Means Clustering)× | Word2Vec× | |
|---|---|---|
| المجال≠ | تعلم الآلة | تنقيب النصوص |
| العائلة≠ | Machine learning | Process / pipeline |
| سنة النشأة≠ | 1967 | 2013 |
| صاحب الطريقة≠ | MacQueen, J. | Tomas Mikolov et al. |
| النوع≠ | Partitional clustering (centroid-based) | Neural word-embedding model |
| المصدر التأسيسي≠ | MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗ | Mikolov, T., Chen, K., Corrado, G. & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. link ↗ |
| الأسماء البديلة | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering | word embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri |
| ذات صلة≠ | 3 | 4 |
| الملخص≠ | K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis. | 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. |
| ScholarGateمجموعة البيانات ↗ |
|
|