Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs

1 code implementation • 18 May 2023 • Jintang Li, Sheng Tian, Ruofan Wu, Liang Zhu, Welong Zhao, Changhua Meng, Liang Chen, Zibin Zheng, Hongzhi Yin

We approach the problem by our proposed STEP, a self-supervised temporal pruning framework that learns to remove potentially redundant edges from input dynamic graphs.

Dynamic Node Classification