قارن الطرق

	شبكة العصبونات الرسومية	اكتشاف المجتمعات	تضمين الشبكة
المجال	تحليل الشبكات	تحليل الشبكات	تحليل الشبكات
العائلة	Process / pipeline	Process / pipeline	Process / pipeline
سنة النشأة	2017–2018 (major variants)	2002–2019 (algorithm family)	2014 (DeepWalk); 2016 (Node2Vec)
صاحب الطريقة	—	Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008)	—
النوع	Deep learning on graph-structured data	Graph-partitioning / clustering algorithm family	Representation learning / unsupervised network method
المصدر التأسيسي	Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR).	Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008.	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.
الأسماء البديلة	GNN, GCN, GAT, GraphSAGE	graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden)	node embedding, graph embedding, network representation learning, Ağ Gömme (Node2Vec, DeepWalk, LINE)
ذات صلة	5	5	3
الملخص	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.	Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network?	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.