ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Stochastic Block Model×Xarxa Neuronal de Grafs×Agrupació jeràrquica×
CampAnàlisi de xarxesAprenentatge profundAprenentatge automàtic
FamíliaProcess / pipelineMachine learningMachine learning
Any d'origen198320171963
Autor originalKipf, T.N. & Welling, M.Ward, J. H.
TipusProbabilistic generative graph modelDeep learning on graph-structured dataUnsupervised clustering (agglomerative)
Font seminalHolland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional 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 ↗
ÀliesSBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Relacionats744
ResumThe 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.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.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.
ScholarGateConjunt de dades
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 1 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Stochastic Block Model · Graph Neural Network · Hierarchical Clustering. Recuperat el 2026-06-19 de https://scholargate.app/ca/compare