Pytorch Geometric笔记

2019-11-17  本文已影响0人  第一个读书笔记

链接:Fast Graph Representation Learning with PyTorch Geometric

https://arxiv.org/pdf/1903.02428.pdf

定义

图: g =(X,(I,E))

X:n个节点, x∈R^{N*F}

边特征: E ∈ R^{E*D}

边indices: I∈N^{2*E}

Neighborhood Aggregation(message passing)

图卷积操作:

图卷积

⬚ : 不同的function,e.g., sum, mean or max

γ : differentiable function, which can be achieved by gathering and scattering of node features and vectorized element-wise computation
3 params are chosen by users.
**已经配置模型:GCN, SGC, GraphSAGE, the attention-based operators GAT and AGNN, the Graph Isomorphism Network(GIN), the Dynamic Neighborhood Aggregation(DNA) operator.
Also provide maximizing mutual information, auto encoding graphs, aggregating jumping knowledge and predict temporal event s in knowledge graphs.

Pooling

Mini-batch Handling

Batches of multiple graph instances (of potentially different size) by automatically creating a single block-diagonal adjacent matrix and concatenating feature matrices in the node dimension.

Application

Semi-supervised classification
Graph classification
Point Cloud classification

上一篇 下一篇

猜你喜欢

热点阅读