ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

K-Means shlukování×Word2Vec×
OborStrojové učeníDolování textu
RodinaMachine learningProcess / pipeline
Rok vzniku19672013
TvůrceMacQueen, J.Tomas Mikolov et al.
TypPartitional clustering (centroid-based)Neural word-embedding model
Původní zdrojMacQueen, 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 ↗
Další názvyK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clusteringword embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri
Příbuzné34
Shrnutí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.
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: K-Means Clustering · Word2Vec. Získáno 2026-06-18 z https://scholargate.app/cs/compare