ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Sztochasztikus Blokk Modell×Gráfon alapuló neurális hálózat×Hierarchikus klaszterezés×
TudományterületHálózatelemzésMélytanulásGépi tanulás
MódszercsaládProcess / pipelineMachine learningMachine learning
Keletkezés éve198320171963
MegalkotóKipf, T.N. & Welling, M.Ward, J. H.
TípusProbabilistic generative graph modelDeep learning on graph-structured dataUnsupervised clustering (agglomerative)
AlapműHolland, 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 ↗
Alternatív nevekSBM, 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
Kapcsolódó744
Összefoglaló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.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.
ScholarGateAdatkészlet
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 3 Források
  3. PUBLISHED
  1. v1
  2. 1 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Stochastic Block Model · Graph Neural Network · Hierarchical Clustering. Letöltve 2026-06-19, forrás: https://scholargate.app/hu/compare