ScholarGate
Asistent

Porovnat metody

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

Grafová pozornostní síť×Hierarchické shlukování×
OborHluboké učeníStrojové učení
RodinaMachine learningMachine learning
Rok vzniku20181963
TvůrceVeličković, P. et al.Ward, J. H.
TypGraph neural network (attention-based)Unsupervised clustering (agglomerative)
Původní zdrojVeličković, P. et al. (2018). Graph Attention 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 ↗
Další názvyGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Příbuzné44
Shrnutí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).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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

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

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