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×DBSCAN×Réseau de neurones à graphes×
DomaineAnalyse de réseauxApprentissage automatiqueApprentissage profond
FamilleProcess / pipelineMachine learningMachine learning
Année d'origine198319962017
Auteur d'origineEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Kipf, T.N. & Welling, M.
TypeProbabilistic generative graph modelDensity-based clustering algorithmDeep learning on graph-structured data
Source fondatriceHolland, 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 ↗Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. ICLR. link ↗
AliasSBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)DBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGrafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network
Apparentées734
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.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.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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 3 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

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