ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

DBSCAN×Grafová pozornostní síť×
OborStrojové učeníHluboké učení
RodinaMachine learningMachine learning
Rok vzniku19962018
TvůrceEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.
TypDensity-based clustering algorithmGraph neural network (attention-based)
Původní zdrojEster, 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 ↗
Další názvyDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network
Příbuzné34
Shrnutí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).
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: DBSCAN · Graph Attention Network. Získáno 2026-06-18 z https://scholargate.app/cs/compare