1 code implementation • ICLR 2019 • Thomas Bonald, Nathan de Lara
In particular, two nodes having many common successors in the graph tend to be represented by close vectors in the embedding space.
no code implementations • 13 Nov 2023 • Thomas Bonald, Nathan de Lara
The task of semi-supervised classification aims at assigning labels to all nodes of a graph based on the labels known for a few nodes, called the seeds.
1 code implementation • 5 Oct 2022 • Flemming Kondrup, Thomas Jiralerspong, Elaine Lau, Nathan de Lara, Jacob Shkrob, My Duc Tran, Doina Precup, Sumana Basu
We design a clinically relevant intermediate reward that encourages continuous improvement of the patient vitals as well as addresses the challenge of sparse reward in RL.
1 code implementation • 27 Aug 2020 • Nathan de Lara, Thomas Bonald
Semi-supervised classification on graphs aims at assigning labels to all nodes of a graph based on the labels known for a few nodes, called the seeds.
2 code implementations • ICLR 2020 • Nathan de Lara, Thomas Bonald
Spectral embedding is a popular technique for the representation of graph data.
1 code implementation • 7 Feb 2019 • Edouard Pineau, Nathan de Lara
We address the problem of graph classification based only on structural information.
Ranked #28 on Graph Classification on NCI1
3 code implementations • 22 Oct 2018 • Nathan de Lara, Edouard Pineau
Graph classification has recently received a lot of attention from various fields of machine learning e. g. kernel methods, sequential modeling or graph embedding.
Ranked #29 on Graph Classification on PTC