Fetching the paper…
Reading the bibliography…
When handling streaming graphs, existing graph representation learning models encounter a catastrophic forgetting problem, where previously learned knowledge of these models is easily overwritten when learning with newly incoming graphs.
A. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Inf. Retr. , 2000
2000
Earlier work this paper cites.
Y. Chen, M. Welling, and A. J. Smola, “Super-samples from kernel herding,” in UAI , 2010
2010
Earlier work this paper cites.
D.-H. Lee et al. , “Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks,” in ICML Workshop , 2013
2013
Earlier work this paper cites.
Z. Wang and J. Ye, “Querying discriminative and representative samples for batch mode active learning,” in KDD , 2013
2013
Earlier work this paper cites.
J. J. McAuley, C. Targett, Q. Shi, and A. van den Hengel, “Image-based recommendations on styles and substitutes,” in SIGIR , 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. S. Zemel, “Gated graph sequence neural networks,” in ICLR , 2016
2016
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Earlier work this paper cites.
D. Lopez-Paz and M. Ranzato, “Gradient episodic memory for continual learning,” in NeurIPS , 2017
2017
Earlier work this paper cites.
R. Aljundi, F. Babiloni, M. Elhoseiny, M. Rohrbach, and T. Tuytelaars, “Memory aware synapses: Learning what (not) to forget,” in ECCV , 2018
2018
Earlier work this paper cites.
Z. Li and D. Hoiem, “Learning without forgetting,” TPAMI , 2018
2018
Earlier work this paper cites.
O. Sener and S. Savarese, “Active learning for convolutional neural networks: A core-set approach,” in ICLR , 2018
2018
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in WWW , 2019
2019
Earlier work this paper cites.
F. Wu, A. H. S. Jr., T. Zhang, C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” in ICML , 2019
2019
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in ICLR , 2019
2019
Earlier work this paper cites.
R. Geirhos, J.-H. Jacobsen, C. Michaelis, R. Zemel, W. Brendel, M. Bethge, and F. A. Wichmann, “Shortcut learning in deep neural networks,” Nature Machine Intelligence , 2020
2020
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” in NeurIPS , 2020
2020
Earlier work this paper cites.
W. Masarczyk and I. Tautkute, “Reducing catastrophic forgetting with learning on synthetic data,” in CVPR Workshop , 2020
2020
Earlier work this paper cites.
R. Qiu, Z. Huang, J. Li, and H. Yin, “Exploiting cross-session information for session-based recommendation with graph neural networks,” TOIS , 2020
2020
Earlier work this paper cites.
R. Qiu, H. Yin, Z. Huang, and T. Chen, “GAG: global attributed graph neural network for streaming session-based recommendation,” in SIGIR , 2020
2020
Cited alongside, same era.
Y. Xu, Y. Zhang, W. Guo, H. Guo, R. Tang, and M. Coates, “Graphsail: Graph structure aware incremental learning for recommender systems,” in CIKM , 2020
2020
Cited alongside, same era.
A. A. Daruna, M. Gupta, M. Sridharan, and S. Chernova, “Continual learning of knowledge graph embeddings,” IEEE Robotics Autom. Lett. , 2021
2021
Cited alongside, same era.
H. Liu, Y. Yang, and X. Wang, “Overcoming catastrophic forgetting in graph neural networks,” in AAAI , 2021
2021
Cited alongside, same era.
A. Rosasco, A. Carta, A. Cossu, V. Lomonaco, and D. Bacciu, “Distilled replay: Overcoming forgetting through synthetic samples,” in CSSL Workshop , 2021
2021
2023
Closest in time.
K. Liang, L. Meng, M. Liu, Y. Liu, W. Tu, S. Wang, S. Zhou, and X. Liu, “Learn from relational correlations and periodic events for temporal knowledge graph reasoning,” in SIGIR , 2023
2023
Closest in time.
Y. Liu, R. Qiu, and Z. Huang, “Cat: Balanced continual graph learning with graph condensation,” in ICDM , 2023
2023
Closest in time.
J. Su, D. Zou, Z. Zhang, and C. Wu, “Towards robust graph incremental learning on evolving graphs,” in ICML , 2023
2023
Closest in time.
A. Unal, A. Akgül, M. Kandemir, and G. Unal, “Meta continual learning on graphs with experience replay,” Transactions on Machine Learning Research , 2023
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
F. Wiewel and B. Yang, “Condensed composite memory continual learning,” in IJCNN , 2021
2021
Cited alongside, same era.
B. Zhao and H. Bilen, “Dataset condensation with differentiable siamese augmentation,” in ICML , 2021
2021
Cited alongside, same era.
B. Zhao, K. R. Mopuri, and H. Bilen, “Dataset condensation with gradient matching,” in ICLR , 2021
2021
Cited alongside, same era.
Q. Guo, F. Zhuang, C. Qin, H. Zhu, X. Xie, H. Xiong, and Q. He, “A survey on knowledge graph-based recommender systems,” TKDE , 2022
2022
Cited alongside, same era.
W. Jin, X. Tang, H. Jiang, Z. Li, D. Zhang, J. Tang, and B. Yin, “Condensing graphs via one-step gradient matching,” in KDD , 2022
2022
Cited alongside, same era.
W. Jin, L. Zhao, S. Zhang, Y. Liu, J. Tang, and N. Shah, “Graph condensation for graph neural networks,” in ICLR , 2022
2022
Cited alongside, same era.
2022
Cited alongside, same era.
Closest in time.
2023
Closest in time.
P. Xie, M. Ma, T. Li, S. Ji, S. Du, Z. Yu, and J. Zhang, “Spatio-temporal dynamic graph relation learning for urban metro flow prediction,” TKDE , 2023
2023
Closest in time.
2023
Closest in time.
L. Zhang, Y. Jiang, and Y. Yang, “Gnngo3d: Protein function prediction based on 3d structure and functional hierarchy learning,” TKDE , 2023
2023
Closest in time.
X. Zhang, D. Song, and D. Tao, “Hierarchical prototype networks for continual graph representation learning,” TPAMI , 2023
2023
Closest in time.
X. Zhang, D. Song, and D. Tao, “Ricci curvature-based graph sparsification for continual graph representation learning,” TNNLS , 2023
2023
Closest in time.
B. Zhao and H. Bilen, “Dataset condensation with distribution matching,” in WACV , 2023
2023
Closest in time.
X. Zheng, M. Zhang, C. Chen, Q. V. H. Nguyen, X. Zhu, and S. Pan, “Structure-free graph condensation: From large-scale graphs to condensed graph-free data,” NeurIPS , 2023
2023
Closest in time.
2023
Closest in time.
S. Choi, W. Kim, S. Kim, Y. In, S. Kim, and C. Park, “DSLR: diversity enhancement and structure learning for rehearsal-based graph continual learning,” in WWW , 2024
2024
Closest in time.
X. Gao, T. Chen, Y. Zang, W. Zhang, Q. V. H. Nguyen, K. Zheng, and H. Yin, “Graph condensation for inductive node representation learning,” ICDE , 2024
2024
Closest in time.
B. Li, E. Pan, and Z. Kang, “Pc-conv: Unifying homophily and heterophily with two-fold filtering,” in AAAI , 2024
2024
Closest in time.
M. Liu, Y. Liu, K. Liang, W. Tu, S. Wang, S. Zhou, and X. Liu, “Deep temporal graph clustering,” ICLR , 2024
2024
Closest in time.
2024
Closest in time.
Y. Tang, R. Qiu, Y. Liu, X. Li, and Z. Huang, “Casegnn: Graph neural networks for legal case retrieval with text-attributed graphs,” in ECIR , 2024
2024
Closest in time.
B. Yang, K. Wang, Q. Sun, C. Ji, X. Fu, H. Tang, Y. You, and J. Li, “Does graph distillation see like vision dataset counterpart?” NeurIPS , 2024
2024
Closest in time.