28 citations · 28 across the 2 of their papers we have counts for
3 papers
Breaking the Limits of Message Passing Graph Neural Networks
Muhammet Balcilar, Pierre Héroux, Benoit Gaüzère +3
Since the Message Passing (Graph) Neural Networks (MPNNs) have a linear complexity with respect to the number of nodes when applied to sparse graphs, they have been widely implemen…
Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks
Muhammet Balcilar, Guillaume Renton, Pierre Heroux +3
This paper aims at revisiting Graph Convolutional Neural Networks by bridging the gap between spectral and spatial design of graph convolutions. We theoretically demonstrate some e…
Generalized Median Graph via Iterative Alternate Minimizations
Nicolas Boria, S'ebastien Bougleux, Benoit Gaüzère +1
Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs.…