ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

شبکه عصبی گراف×تعبیه شبکه×
حوزهتحلیل شبکهتحلیل شبکه
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش2017–2018 (major variants)2014 (DeepWalk); 2016 (Node2Vec)
پدیدآور
نوعDeep learning on graph-structured dataRepresentation learning / unsupervised network method
منبع بنیادینKipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗Grover, A. & Leskovec, J. (2016). Node2Vec: Scalable Feature Learning for Networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 855-864. DOI ↗
نام‌های دیگرGNN, GCN, GAT, GraphSAGEnode embedding, graph embedding, network representation learning, Ağ Gömme (Node2Vec, DeepWalk, LINE)
مرتبط53
خلاصه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.Network embedding is a family of representation-learning methods that map each node of a graph into a dense, low-dimensional vector while preserving the network's structural properties. The approach was formalised for social-network data by Perozzi, Al-Rfou, and Skiena with DeepWalk (2014), which adapted the Word2Vec skip-gram model to random walks on graphs, and extended by Grover and Leskovec with Node2Vec (2016), which introduced a biased random walk that balances breadth-first and depth-first exploration. These embeddings turn relational data into feature vectors that standard machine-learning classifiers and clustering algorithms can consume directly.
ScholarGateمجموعه‌داده
  1. v1
  2. 3 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Graph Neural Network (Network Analysis) · Network Embedding. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare