ScholarGate
Асистент

Порівняння методів

Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.

Графові нейронні мережі×Центральність PageRank×Word2Vec×
ГалузьМережевий аналізМережевий аналізІнтелектуальний аналіз тексту
РодинаProcess / pipelineMachine learningProcess / pipeline
Рік появи2017–2018 (major variants)19992013
Автор методуPage, Brin, Motwani & WinogradTomas Mikolov et al.
ТипDeep learning on graph-structured dataIterative link-based centrality algorithmNeural word-embedding model
Основоположне джерелоKipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗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 ↗
Інші назвиGNN, GCN, GAT, GraphSAGEGoogle PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliğiword embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri
Пов'язані524
ПідсумокA Graph Neural Network (GNN) is a deep learning architecture that operates directly on graph-structured data by combining node features with structural information through iterative neighborhood message passing. The three canonical variants — the Graph Convolutional Network (GCN) introduced by Kipf and Welling in 2017, the Graph Attention Network (GAT) introduced by Veličković et al. in 2018, and GraphSAGE — differ in how they aggregate neighbor information: GCN applies a spectral convolution over the full adjacency, GAT weights neighbors by learned attention scores, and GraphSAGE samples and aggregates local neighborhoods inductively, enabling generalization to unseen nodes.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. 3 Джерела
  3. PUBLISHED
  1. v1
  2. 1 Джерела
  3. PUBLISHED
  1. v1
  2. 1 Джерела
  3. PUBLISHED

Перейти до пошуку Завантажити слайди

ScholarGateПорівняння методів: Graph Neural Network (Network Analysis) · PageRank · Word2Vec. Отримано 2026-06-17 з https://scholargate.app/uk/compare