方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机块模型× | 主成分分析× | |
|---|---|---|
| 领域≠ | 网络分析 | 机器学习 |
| 方法族≠ | Process / pipeline | Machine learning |
| 起源年份≠ | 1983 | 2002 |
| 提出者≠ | — | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| 类型≠ | Probabilistic generative graph model | Unsupervised dimensionality reduction |
| 开创性文献≠ | Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| 别名 | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| 相关≠ | 7 | 3 |
| 摘要≠ | 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. | Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures. |
| ScholarGate数据集 ↗ |
|
|