08 Graph Based Machine Learning Flashcards

1
Q

what are the types of graph data

A

networks and graphs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what are the graph based ML tasks

A
  1. node classification
    - predict property
  2. edge prediction
    - predict missing link between nodes
  3. graph classification
    - categorise different graphs
  4. clustering
    - discover communities
  5. graph generation
    - generate new graph structure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
A

raw data -> feature engineering AND graph data -> learning algorithm -> model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what are the node features

A
  1. node degree
    - v = node
    - k(v) = edges that v has
  2. node centrality
    - eg. closeness
  3. clustering coefficient
    - how connected node V’s neighborhood of nodes are
  4. graphlets
    - graphlet degree vector counts the number of graphlet that a node participates in
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are the edge features

A
  1. distance based
    - measure distance between nodes
  2. local neighborhood overlap
    - measure the degree of neighborhood overlaps locally
  3. global neighborhood overlap
    - measure the degree of neighborhood overlaps globally
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what is the kernel method

A
  1. design kernels instead of feature vectors
  2. measures similarity between data points
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is graph based machine learning

A

focus on developing algorithms for analysing data that can be represented as graphs or networks. data is represented as nodes connected by edges. relies on structural information present in graphs to make predictions, perform clustering, classification…

key concepts
1. first step is to represent data as a graph. Nodes represent entities, edges represent relationships

  1. node embedding aims to map each node in the graph to a low dimensional vector representation
  2. graph convolutional networks (GCN) extend the concept of convolutional neural networks to graph structured data. applies convolutional operations to nodes in the graph
  3. graph clustering aims to partition nodes in graph into groups of clusters based on their similarities or connections.
  4. link prediction predicts missing/ future connection between nodes
  5. graph neural networks are deep learning modesl designed to operate on graph structured data. combination of node embedding and graph convolutional layers
  6. graph based recommender systems provide personalised recommendations by modeling user-item interactions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

why use node embedding

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly