pith. sign in

Motif-based Convolutional Neural Network on Graphs

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.LG 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

HONEM: Learning Embedding for Higher Order Networks

cs.LG · 2019-08-15 · 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.

citing papers explorer

Showing 1 of 1 citing paper.

  • HONEM: Learning Embedding for Higher Order Networks cs.LG · 2019-08-15 · unverdicted · none · ref 43 · internal anchor

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