representation
N is the number of Nodes
node feature
neighbourhood+leakrelu->node
update
with head=k
multi-head+neighbourhood->node
graph相关的算法,都是相邻点的embedding表达,不断的迭代, gat就是 通过建立相邻边的attention,来拟合周边attention,
multihead机制,提升图attention效果
representation
N is the number of Nodes
node feature
neighbourhood+leakrelu->node
update
with head=k
multi-head+neighbourhood->node
graph相关的算法,都是相邻点的embedding表达,不断的迭代, gat就是 通过建立相邻边的attention,来拟合周边attention,
multihead机制,提升图attention效果