pith. sign in

arxiv: 1711.05697 · v4 · pith:ZRNS6RBYnew · submitted 2017-11-15 · 💻 cs.LG · cs.SI

Motif-based Convolutional Neural Network on Graphs

classification 💻 cs.LG cs.SI
keywords graphscnnsconvolutionalgraphheterogeneoushigh-ordermodelmultiple
0
0 comments X
read the original abstract

This paper introduces a generalization of Convolutional Neural Networks (CNNs) to graphs with irregular linkage structures, especially heterogeneous graphs with typed nodes and schemas. We propose a novel spatial convolution operation to model the key properties of local connectivity and translation invariance, using high-order connection patterns or motifs. We develop a novel deep architecture Motif-CNN that employs an attention model to combine the features extracted from multiple patterns, thus effectively capturing high-order structural and feature information. Our experiments on semi-supervised node classification on real-world social networks and multiple representative heterogeneous graph datasets indicate significant gains of 6-21% over existing graph CNNs and other state-of-the-art techniques.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. HONEM: Learning Embedding for Higher Order Networks

    cs.LG 2019-08 unverdicted novelty 6.0

    HONEM learns embeddings for higher-order networks capturing non-Markovian dependencies and outperforms baselines on node classification, reconstruction, link prediction, and visualization.