ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Modèle de blocs stochastiques×Réseau d'attention sur graphe×Regroupement hiérarchique×
DomaineAnalyse de réseauxApprentissage profondApprentissage automatique
FamilleProcess / pipelineMachine learningMachine learning
Année d'origine198320181963
Auteur d'origineVeličković, P. et al.Ward, J. H.
TypeProbabilistic generative graph modelGraph neural network (attention-based)Unsupervised clustering (agglomerative)
Source fondatriceHolland, 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 ↗
AliasSBM, 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
Apparentées744
Résumé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.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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Stochastic Block Model · Graph Attention Network · Hierarchical Clustering. Consulté le 2026-06-19 sur https://scholargate.app/fr/compare