ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Centralidade PageRank×Word2Vec×
ÁreaAnálise de redesMineração de texto
FamíliaMachine learningProcess / pipeline
Ano de origem19992013
Autor originalPage, Brin, Motwani & WinogradTomas Mikolov et al.
TipoIterative link-based centrality algorithmNeural word-embedding model
Fonte seminalPage, 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 ↗
Outros nomesGoogle PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliğiword embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri
Relacionados24
ResumoPageRank 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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: PageRank · Word2Vec. Recuperado em 2026-06-18 de https://scholargate.app/pt/compare