no code implementations • 16 Mar 2017 • Francesco Orsini, Daniele Baracchi, Paolo Frasconi
We introduce an architecture based on deep hierarchical decompositions to learn effective representations of large graphs.
no code implementations • Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) 2015 • Francesco Orsini, Paolo Frasconi, Luc De Raedt
Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role, using a suitable vertex invariant.
Ranked #1 on Graph Classification on FRANKENSTEIN