方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 图神经网络× | 层次聚类× | |
|---|---|---|
| 领域≠ | 深度学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2017 | 1963 |
| 提出者≠ | Kipf, T.N. & Welling, M. | Ward, J. H. |
| 类型≠ | Deep learning on graph-structured data | Unsupervised clustering (agglomerative) |
| 开创性文献≠ | 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 ↗ |
| 别名≠ | Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关 | 4 | 4 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|