ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

PageRank Centrality×Word2Vec×
领域网络分析文本挖掘
方法族Machine learningProcess / pipeline
起源年份19992013
提出者Page, Brin, Motwani & WinogradTomas Mikolov et al.
类型Iterative link-based centrality algorithmNeural 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ğiword embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri
相关24
摘要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数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: PageRank · Word2Vec. 于 2026-06-18 检索自 https://scholargate.app/zh/compare