Linganisha mbinu
Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.
| Stochastic Block Model× | Mtandao wa Neural wa Grafu× | Ngeli ya Kiwango cha Juu (Hierarchical Clustering)× | |
|---|---|---|---|
| Nyanja≠ | Uchanganuzi wa Mitandao | Ujifunzaji wa Kina | Ujifunzaji wa Mashine |
| Familia≠ | Process / pipeline | Machine learning | Machine learning |
| Mwaka wa asili≠ | 1983 | 2017 | 1963 |
| Mwanzilishi≠ | — | Kipf, T.N. & Welling, M. | Ward, J. H. |
| Aina≠ | Probabilistic generative graph model | Deep learning on graph-structured data | Unsupervised clustering (agglomerative) |
| Chanzo asilia≠ | 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 ↗ |
| Majina mbadala≠ | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) | Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Zinazohusiana≠ | 7 | 4 | 4 |
| Muhtasari≠ | 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. |
| ScholarGateSeti ya data ↗ |
|
|
|