1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2019
Extrapolating paths with graph neural networks
Jean-Baptiste Cordonnier, Andreas Loukas
We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. I…
cs.LG2019★ 1 cited
Approximating Spectral Clustering via Sampling: a Review
Nicolas Tremblay, Andreas Loukas
Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. T…