ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Stochastic Block Model×DBSCAN×Grafička mrežna mreža s pažnjom (Graph Attention Network, GAT)×Grafne neuronske mreže×
PodručjeAnaliza mrežaStrojno učenjeDuboko učenjeDuboko učenje
ObiteljProcess / pipelineMachine learningMachine learningMachine learning
Godina nastanka1983199620182017
TvoracEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.Kipf, T.N. & Welling, M.
VrstaProbabilistic generative graph modelDensity-based clustering algorithmGraph neural network (attention-based)Deep learning on graph-structured data
Temeljni izvorHolland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗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. link ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. ICLR. link ↗
Drugi naziviSBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)DBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkGrafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network
Srodne7344
SažetakThe 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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 3 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Stochastic Block Model · DBSCAN · Graph Attention Network · Graph Neural Network. Preuzeto 2026-06-19 s https://scholargate.app/hr/compare