SDG: A Simplified and Dynamic Graph Neural Network
Authors:
Open Access
- 11 July 2021
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2273-2277
Abstract
Graph Neural Networks (GNNs) have achieved state-of-the-art performance in many high-impact applications such as fraud detection, information retrieval, and recommender systems due to their powerful representation learning capabilities. Some nascent efforts have been concentrated on simplifying the structures of GNN models, in order to reduce the computational complexity. However, the dynamic nature of these applications requires GNN structures to be evolving over time, which has been largely overlooked so far. To bridge this gap, in this paper, we propose a simplified and dynamic graph neural network model, called SDG. It is efficient, effective, and provides interpretable predictions. In particular, in SDG, we replace the traditional message-passing mechanism of GNNs with the designed dynamic propagation scheme based on the personalized PageRank tracking process. We conduct extensive experiments and ablation studies to demonstrate the effectiveness and efficiency of our proposed SDG. We also design a case study on fake news detection to show the interpretability of SDG.Keywords
Funding Information
- U.S. Department of Homeland Security (17STQAC00001-03-03)
- NSF (National Science Foundation) (IIS-1947203, IIS-2002540)
This publication has 5 references indexed in Scilit:
- A View-Adversarial Framework for Multi-View Network Embedding2020
- Alleviating the Inconsistency Problem of Applying Graph Neural Network to Fraud Detection2020
- Item Tagging for Information Retrieval: A Tripartite Graph Neural Network based Approach2020
- LightGCN2020
- TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs2018