ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Rețeaua de Atenție Grafică×Clustering Ierarhic×
DomeniuÎnvățare profundăÎnvățare automată
FamilieMachine learningMachine learning
Anul apariției20181963
Autorul originalVeličković, P. et al.Ward, J. H.
TipGraph neural network (attention-based)Unsupervised clustering (agglomerative)
Sursa seminalăVelič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 ↗
Denumiri alternativeGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Înrudite44
RezumatThe 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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Graph Attention Network · Hierarchical Clustering. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare