Slides by Nolan Dey Graph Notation A B A B C D A B C D A 0 - - PowerPoint PPT Presentation

slides by nolan dey
SMART_READER_LITE
LIVE PREVIEW

Slides by Nolan Dey Graph Notation A B A B C D A B C D A 0 - - PowerPoint PPT Presentation

Slides by Nolan Dey Graph Notation A B A B C D A B C D A 0 1 0 0 A 1 0 0 0 B 0 0 1 1 B 0 2 0 0 A = D = C D C 0 0 0 1 C 0 0 1 0 D 0 0 0 0 D 0 0 0 0 A = adjacency matrix > defines graph edges D = degree matrix


slide-1
SLIDE 1

Slides by Nolan Dey

slide-2
SLIDE 2

Graph Notation

  • A = adjacency matrix —> defines graph edges
  • D = degree matrix —> defines number of edges per node
  • ̂

A = A + I ̂ D = D + I

A D C B A B C D A 0 1 0 0 B 0 0 1 1 C 0 0 0 1 D 0 0 0 0

A =

A B C D A 1 0 0 0 B 0 2 0 0 C 0 0 1 0 D 0 0 0 0

D =

slide-3
SLIDE 3

Network Notation

  • Number of nodes
  • Number of node features at

layer

  • Hidden representation at

layer

  • N =

dl = lth Fl = lth Fl → (N × dl) F0 = X A → (N × N)

slide-4
SLIDE 4

GCN Layer

  • Fully connected layer:
  • GCN layer:
  • aggregate purpose: Take a weighted sum of features from

adjacent nodes (analog of convolution)

  • transform purpose : Transform aggregated features using a

weight matrix

  • GCN layer:

Fl = σ(Fl−1Wl + b) Fl = σ(transform(aggregate(A, Fl−1), Wl))

transform(M, Wl) = MWl

Fl = σ(aggregate(A, Fl−1)Wl)

slide-5
SLIDE 5

Sum Aggregation

  • aggregate(A, Fl−1) = AFl−1
  • Pros: Aggregated features are the sum of the features of

neighbouring nodes

  • Cons: A node’s own features do not get propagated
slide-6
SLIDE 6

Sum Aggregation 2

  • aggregate(A, Fl−1) =

̂ AFl−1 ̂ A = A + I

  • Pros: Aggregated features are the sum of a node’s own

features and the features of neighbouring nodes

  • Cons: Nodes with more connections have features of

higher magnitude

slide-7
SLIDE 7

Mean Aggregation

  • aggregate(A, Fl−1) =

̂ D−1 ̂ AFl−1 ̂ Dii = ∑

j

̂ Aij

  • Pros: Aggregated features are the average of a node’s
  • wn features and the features of neighbouring nodes
  • Cons: Dynamics are “not interesting enough”
slide-8
SLIDE 8

Spectral Aggregation

  • First order approximation of a spectral graph convolution

aggregate(A, Fl−1) =

̂ D−1/2 ̂ A ̂ D−1/2Fl−1

slide-9
SLIDE 9

What are GCNs?

  • GCN layer:
  • GCN layer output:

Fl = σ(transform(aggregate(A, Fl−1), Wl))

transform(M, Wl) = MWl aggregate(A, Fl−1) =

̂ D−1/2 ̂ A ̂ D−1/2Fl−1 Fl = ReLU( ̂ D− 1

2

̂ A ̂ D− 1

2Fl−1Wl)

slide-10
SLIDE 10

Sample Dataset: Blood Brain Barrier Penetration (BBBP)

  • Binary Classification
  • 2050 molecules
  • 1567 penetrate the blood brain barrier
  • 483 do not penetrate the blood brain barrier
  • Applications in drug design
slide-11
SLIDE 11

Sample Architecture

slide-12
SLIDE 12

Applications

  • Image classification
  • Recommender systems
  • Path planning
  • 3D point cloud segmentation and classification
  • Molecular classification
slide-13
SLIDE 13

Thank you!