README.txt 1.99 KB
Newer Older
1
2
.. _tutorials1-index:

3
Graph neural networks and its variants
4
====================================
5

6
* **Graph convolutional network (GCN)** `[research paper] <https://arxiv.org/abs/1609.02907>`__ `[tutorial]
Da Zheng's avatar
Da Zheng committed
7
8
9
10
  <1_gnn/1_gcn.html>`__ `[Pytorch code]
  <https://github.com/dmlc/dgl/blob/master/examples/pytorch/gcn>`__
  `[MXNet code]
  <https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn>`__:
11
  This is the most basic GCN. The tutorial covers the basic uses of DGL APIs.
12

13
* **Graph attention network (GAT)** `[research paper] <https://arxiv.org/abs/1710.10903>`__ `[tutorial]
Hao Zhang's avatar
Hao Zhang committed
14
  <1_gnn/9_gat.html>`__ `[Pytorch code]
Da Zheng's avatar
Da Zheng committed
15
16
17
  <https://github.com/dmlc/dgl/blob/master/examples/pytorch/gat>`__
  `[MXNet code]
  <https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat>`__:
18
19
  GAT extends the GCN functionality by deploying multi-head attention
  among neighborhood of a node. This greatly enhances the capacity and
20
21
  expressiveness of the model.

22
* **Relational-GCN** `[research paper] <https://arxiv.org/abs/1703.06103>`__ `[tutorial]
Da Zheng's avatar
Da Zheng committed
23
24
25
26
  <1_gnn/4_rgcn.html>`__ `[Pytorch code]
  <https://github.com/dmlc/dgl/tree/master/examples/pytorch/rgcn>`__
  `[MXNet code]
  <https://github.com/dmlc/dgl/tree/master/examples/mxnet/rgcn>`__:
27
28
  Relational-GCN allows multiple edges among two entities of a
  graph. Edges with distinct relationships are encoded differently. 
29

30
* **Line graph neural network (LGNN)** `[research paper] <https://openreview.net/pdf?id=H1g0Z3A9Fm>`__ `[tutorial]
Da Zheng's avatar
Da Zheng committed
31
  <1_gnn/6_line_graph.html>`__ `[Pytorch code]
Minjie Wang's avatar
Minjie Wang committed
32
  <https://github.com/dmlc/dgl/tree/master/examples/pytorch/line_graph>`__:
33
  This network focuses on community detection by inspecting graph structures. It
34
  uses representations of both the original graph and its line-graph
35
36
37
  companion. In addition to demonstrating how an algorithm can harness multiple
  graphs, this implementation shows how you can judiciously mix simple tensor
  operations and sparse-matrix tensor operations, along with message-passing with
38
  DGL.