방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| DBSCAN× | 그래프 신경망× | |
|---|---|---|
| 분야≠ | 머신러닝 | 딥러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1996 | 2017 |
| 창시자≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Kipf, T.N. & Welling, M. |
| 유형≠ | Density-based clustering algorithm | Deep learning on graph-structured data |
| 원전≠ | 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 ↗ |
| 별칭≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|