Fetching the paper…
Reading the bibliography…
Despite significant advances in graph representation learning, little attention has been paid to the more practical continual learning scenario in which new categories of nodes (e.g., new research areas in citation networks, or new types of products in co-purchasing networks) and their associated edges are continuously emerging, causing catastrophic forgetting on previous categories.
A. Chrysakis and M.-F. Moens, “Online continual learning from imbalanced data,” in International Conference on Machine Learning . PMLR, 2020, pp. 1952–1961
1961
Earlier work this paper cites.
C. L. Giles, K. D. Bollacker, and S. Lawrence, “Citeseer: An automatic citation indexing system,” in Proceedings of the third ACM Conference on Digital Libraries , 1998, pp. 89–98
1998
Earlier work this paper cites.
A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, no. 2, pp. 127–163, 2000
2000
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American Society for Information Science and Technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
D. Zeithamova, W. T. Maddox, and D. M. Schnyer, “Dissociable prototype learning systems: Evidence from brain imaging and behavior,” Journal of Neuroscience , vol. 28, no. 49, pp. 13 194–13 201, 2008
2008
Earlier work this paper cites.
L. Van der Maaten and G. Hinton, “Visualizing data using t-sne.” Journal of Machine Learning Research , vol. 9, no. 11, 2008
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
L. Van der Maaten and G. Hinton, “Visualizing data using t-sne.” Journal of Machine Learning Research , vol. 9, no. 11, 2008
2008
Earlier work this paper cites.
J. Tang, J. Sun, C. Wang, and Z. Yang, “Social influence analysis in large-scale networks,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge discovery and data mining , 2009, pp. 807–816
2009
Earlier work this paper cites.
J. Tang, J. Sun, C. Wang, and Z. Yang, “Social influence analysis in large-scale networks,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge discovery and data mining , 2009, pp. 807–816
2009
Earlier work this paper cites.
S. Bhagat, G. Cormode, and S. Muthukrishnan, “Node classification in social networks,” in Social Network Data Analytics . Springer, 2011, pp. 115–148
2011
Earlier work this paper cites.
2013
Earlier work this paper cites.
T. Dandan, Z. Haixue, L. Wenfu, Y. Wenjing, Q. Jiang, and Z. Qinglin, “Brain activity in using heuristic prototype to solve insightful problems,” Behavioural Brain Research , vol. 253, pp. 139–144, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. Bhatia, K. Dahiya, H. Jain, P. Kar, A. Mittal, Y. Prabhu, and M. Varma, “The extreme classification repository: Multi-label datasets and code,” 2016. [Online]. Available: http://manikvarma.org/downloads/XC/XMLRepository.html
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. Bhatia, K. Dahiya, H. Jain, P. Kar, A. Mittal, Y. Prabhu, and M. Varma, “The extreme classification repository: Multi-label datasets and code,” 2016. [Online]. Available: http://manikvarma.org/downloads/XC/XMLRepository.html
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Z. Li and D. Hoiem, “Learning without forgetting,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 40, no. 12, pp. 2935–2947, 2017
2017
Cited alongside, same era.
J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska et al. , “Overcoming catastrophic forgetting in neural networks,” Proceedings of the National Academy of Sciences , vol. 114, no. 13, pp. 3521–3526, 2017
2017
Cited alongside, same era.
D. Lopez-Paz and M. Ranzato, “Gradient episodic memory for continual learning,” in Advances in Neural Information Processing Systems , 2017, pp. 6467–6476
2017
Cited alongside, same era.
H. Shin, J. K. Lee, J. Kim, and J. Kim, “Continual learning with deep generative replay,” in Advances in Neural Information Processing Systems , 2017, pp. 2990–2999
2017
Cited alongside, same era.
2020
Later among the works it cites.
C. R. Bowman, T. Iwashita, and D. Zeithamova, “Tracking prototype and exemplar representations in the brain across learning,” Elife , vol. 9, p. e59360, 2020
2020
Later among the works it cites.
M. Farajtabar, N. Azizan, A. Mott, and A. Li, “Orthogonal gradient descent for continual learning,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2020, pp. 3762–3773
2020
Later among the works it cites.
L. Caccia, E. Belilovsky, M. Caccia, and J. Pineau, “Online learned continual compression with adaptive quantization modules,” in International Conference on Machine Learning . PMLR, 2020, pp. 1240–1250
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
W. Yu, W. Cheng, C. C. Aggarwal, K. Zhang, H. Chen, and W. Wang, “Netwalk: A flexible deep embedding approach for anomaly detection in dynamic networks,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 2672–2681
2018
Cited alongside, same era.
G. H. Nguyen, J. B. Lee, R. A. Rossi, N. K. Ahmed, E. Koh, and S. Kim, “Continuous-time dynamic network embeddings,” in Companion Proceedings of the The Web Conference 2018 , 2018, pp. 969–976
2018
Cited alongside, same era.
L. Zhou, Y. Yang, X. Ren, F. Wu, and Y. Zhuang, “Dynamic network embedding by modeling triadic closure process,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 32, no. 1, 2018
2018
Cited alongside, same era.
R. Aljundi, F. Babiloni, M. Elhoseiny, M. Rohrbach, and T. Tuytelaars, “Memory aware synapses: Learning what (not) to forget,” in Proceedings of the European Conference on Computer Vision (ECCV) , 2018, pp. 139–154
2018
Cited alongside, same era.
D. Zou, Z. Hu, Y. Wang, S. Jiang, Y. Sun, and Q. Gu, “Layer-dependent importance sampling for training deep and large graph convolutional networks,” in Advances in Neural Information Processing Systems , 2019, pp. 11 247–11 256
2019
Cited alongside, same era.
J. Yoon, S. Kim, E. Yang, and S. J. Hwang, “Scalable and order-robust continual learning with additive parameter decomposition,” in International Conference on Learning Representation , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Knoblauch, H. Husain, and T. Diethe, “Optimal continual learning has perfect memory and is np-hard,” in International Conference on Machine Learning . PMLR, 2020, pp. 5327–5337
2020
Later among the works it cites.
X. Zhang, C. Xu, and D. Tao, “Context aware graph convolution for skeleton-based action recognition,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 14 333–14 342
2020
Later among the works it cites.
H. Lei, N. Akhtar, and A. Mian, “Spherical kernel for efficient graph convolution on 3d point clouds,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Later among the works it cites.
X. Zhang, C. Xu, and D. Tao, “On dropping clusters to regularize graph convolutional neural networks,” in European Conference on Computer Vision , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Wang, G. Song, Y. Wu, and L. Wang, “Streaming graph neural networks via continual learning,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management , 2020, pp. 1515–1524
2020
Later among the works it cites.
C. Wang, Y. Qiu, and S. Scherer, “Lifelong graph learning,” arXiv preprint arXiv:2009.00647 , 2020
2020
Later among the works it cites.
Y. Ma, Z. Guo, Z. Ren, J. Tang, and D. Yin, “Streaming graph neural networks,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2020, pp. 719–728
2020
Later among the works it cites.
H. Yao, C. Zhang, Y. Wei, M. Jiang, S. Wang, J. Huang, N. Chawla, and Z. Li, “Graph few-shot learning via knowledge transfer,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 6656–6663
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
K. Wang, Z. Shen, C. Huang, C.-H. Wu, Y. Dong, and A. Kanakia, “Microsoft academic graph: When experts are not enough,” Quantitative Science Studies , vol. 1, no. 1, pp. 396–413, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
F. Zhou and C. Cao, “Overcoming catastrophic forgetting in graph neural networks with experience replay,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 5, 2021, pp. 4714–4722
2021
Closest in time.
G. Saha and K. Roy, “Gradient projection memory for continual learning,” in International Conference on Learning Representation , 2021
2021
Closest in time.
H. Gao, Y. Liu, and S. Ji, “Topology-aware graph pooling networks,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2021
2021
Closest in time.
Z. Guo, C. Zhang, W. Yu, J. Herr, O. Wiest, M. Jiang, and N. V. Chawla, “Few-shot graph learning for molecular property prediction,” in Proceedings of the Web Conference 2021 , 2021, pp. 2559–2567
2021
Closest in time.