השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| מרכזיות PageRank× | Word2Vec× | |
|---|---|---|
| תחום≠ | ניתוח רשתות | כריית טקסט |
| משפחה≠ | Machine learning | Process / pipeline |
| שנת המקור≠ | 1999 | 2013 |
| הוגה השיטה≠ | Page, Brin, Motwani & Winograd | Tomas Mikolov et al. |
| סוג≠ | Iterative link-based centrality algorithm | Neural word-embedding model |
| מקור מכונן≠ | Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report. link ↗ | Mikolov, T., Chen, K., Corrado, G. & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. link ↗ |
| כינויים | Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği | word embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri |
| קשורות≠ | 2 | 4 |
| תקציר≠ | PageRank is a link-based centrality algorithm that assigns an importance score to each node in a directed graph by measuring how many high-quality nodes point to it. Introduced by Larry Page, Sergey Brin, Rajeev Motwani, and Terry Winograd at Stanford University in 1999, it became the mathematical foundation of the Google search engine and remains one of the most influential algorithms in network science and information retrieval. | 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מערך נתונים ↗ |
|
|