1 Graph U-Nets - Department of Computer Science & Engineering
Hongyang Gao and Shuiwang Ji
Graph U-Nets
Texas A&M University
Graph U-Nets Hongyang Gao and Shuiwang Ji Texas A&M University - - PowerPoint PPT Presentation
Graph U-Nets Hongyang Gao and Shuiwang Ji Texas A&M University Graph U-Nets - Department of Computer Science & Engineering 1 IMAGE VS. GRAPH Image can be treated as a special graph with well-defined locality. There is no locality
1 Graph U-Nets - Department of Computer Science & Engineering
Hongyang Gao and Shuiwang Ji
Texas A&M University
2 Graph U-Nets - Department of Computer Science & Engineering
Image can be treated as a special graph with well-defined locality. There is no locality information on normal graph, which makes it hard to define pooling and un-pooling operation on graph data. Node classification problems can be considered as image segmentation
3 Graph U-Nets - Department of Computer Science & Engineering
Conv layer
GCN layer
Pooling layer
?
Un-pooling layer
?
https://lmb.informatik.uni-freiburg.de/people/ronneber/u-net/
Node classification Image segmentation
4 Graph U-Nets - Department of Computer Science & Engineering
Projection Top k Node Selection Gate ! " # #
$ % %ℓ'( %ℓ
×
*ℓ'(
idx
*ℓ
Outputs top k sigmoid
⨀
Inputs 1 !
5 Graph U-Nets - Department of Computer Science & Engineering
gUnpool layer uses position information from gPool layer to reconstruct original graph structure.
gPool gUnpool GCN
6 Graph U-Nets - Department of Computer Science & Engineering
GCN
Inputs
GCN GCN GCN GCN gPool gPool gUnpool gUnpool Network Embedding
7 Graph U-Nets - Department of Computer Science & Engineering
Results on node classification tasks: Results on graph classification tasks:
8 Graph U-Nets - Department of Computer Science & Engineering