ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Model blokowy stochastyczny×Sieć uwagi grafowej×Klasteryzacja hierarchiczna×
DziedzinaAnaliza sieciUczenie głębokieUczenie maszynowe
RodzinaProcess / pipelineMachine learningMachine learning
Rok powstania198320181963
TwórcaVeličković, P. et al.Ward, J. H.
TypProbabilistic generative graph modelGraph neural network (attention-based)Unsupervised clustering (agglomerative)
Źródło pierwotneHolland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗
Inne nazwySBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Pokrewne744
PodsumowanieThe 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.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).Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 1 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Stochastic Block Model · Graph Attention Network · Hierarchical Clustering. Pobrano 2026-06-19 z https://scholargate.app/pl/compare