方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| DBSCAN× | 图注意力网络× | |
|---|---|---|
| 领域≠ | 机器学习 | 深度学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 2018 |
| 提出者≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Veličković, P. et al. |
| 类型≠ | Density-based clustering algorithm | Graph neural network (attention-based) |
| 开创性文献≠ | 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 ↗ | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ |
| 别名≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network |
| 相关≠ | 3 | 4 |
| 摘要≠ | 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. | The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN). |
| ScholarGate数据集 ↗ |
|
|