Krahasoni metodat

	Modeli Bllokues Stokastik	DBSCAN	Rrjeti me Vëmendje Grafike	Rrjeti Neurale i Grafëve
Fusha	Analiza e rrjeteve	Mësimi i makinës	Mësimi i thellë	Mësimi i thellë
Familja	Process / pipeline	Machine learning	Machine learning	Machine learning
Viti i origjinës	1983	1996	2018	2017
Krijuesi	—	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Veličković, P. et al.	Kipf, T.N. & Welling, M.
Lloji	Probabilistic generative graph model	Density-based clustering algorithm	Graph neural network (attention-based)	Deep learning on graph-structured data
Burimi themelues	Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.	Veličković, P. et al. (2018). Graph Attention Networks. ICLR.	Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. ICLR.
Emërtime të tjera	SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network	Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network
Të lidhura	7	3	4	4
Përmbledhja	The Stochastic Block Model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is a probabilistic generative model for graphs that assigns nodes to latent blocks and parametrically estimates the connection probabilities between blocks. It is the foundational approach for community detection, core-periphery identification, and hierarchical structure discovery in network analysis.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.	The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).	A Graph Neural Network (GNN) is a deep learning method, popularised by Kipf and Welling in 2017 with the Graph Convolutional Network, that learns from the relationships in network (graph) structures made of nodes and edges. It is designed for data that is naturally relational, such as social networks, molecular structures, and recommendation systems.