Feature Interaction-aware Graph Neural Networks
arXiv:1908.07110
Abstract
Inspired by the immense success of deep learning, graph neural networks (GNNs) are widely used to learn powerful node representations and have demonstrated promising performance on different graph learning tasks. However, most real-world graphs often come with high-dimensional and sparse node features, rendering the learned node representations from existing GNN architectures less expressive. In this paper, we propose \textit{Feature Interaction-aware Graph Neural Networks (FI-GNNs)}, a plug-and-play GNN framework for learning node representations encoded with informative feature interactions. Specifically, the proposed framework is able to highlight informative feature interactions in a personalized manner and further learn highly expressive node representations on feature-sparse graphs. Extensive experiments on various datasets demonstrate the superior capability of FI-GNNs for graph learning tasks.
References in corpus (13)
- Adam: A Method for Stochastic Optimization
- Semi-Supervised Classification with Graph Convolutional Networks
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Spectral Networks and Locally Connected Networks on Graphs
- DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
- Attributed Network Embedding for Learning in a Dynamic Environment
- How Powerful are Graph Neural Networks?
- Link Prediction Based on Graph Neural Networks
- Neural Collaborative Filtering
- Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks
- Adversarially Regularized Graph Autoencoder for Graph Embedding
- Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms