Shift Aggregate Extract Networks

Abstract

We introduce an architecture based on deep hierarchical decompositions to learn effective representations of large graphs. Our framework extends classic R-decompositions used in kernel methods, enabling nested part-of-part relations. Unlike recursive neural networks, which unroll a template on input graphs directly, we unroll a neural network template over the decomposition hierarchy, allowing us to deal with the high degree variability that typically characterize social network graphs. Deep hierarchical decompositions are also amenable to domain compression, a technique that reduces both space and time complexity by exploiting symmetries. We show empirically that our approach is able to outperform current state-of-the-art graph classification methods on large social network datasets, while at the same time being competitive on small chemobiological benchmark datasets.

Cited by in corpus (6)

• Graph Inference Learning for Semi-supervised Classification
• Walk-Steered Convolution for Graph Classification
• When Work Matters: Transforming Classical Network Structures to Graph CNN
• Learning and Interpreting Multi-Multi-Instance Learning Networks
• Multi-hop assortativities for networks classification
• Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College