Fetching the paper…
Reading the bibliography…
Graph representation learning (GRL) is critical for graph-structured data analysis.
D. M. Hawkins, “The problem of overfitting,” Journal of chemical information and computer sciences , vol. 44, no. 1, pp. 1–12, 2004
2004
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.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE signal processing magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” ICLR , 2014
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in SIGKDD , 2014
2014
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature , 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
H. Dai, B. Dai, and L. Song, “Discriminative embeddings of latent variable models for structured data,” in ICML . PMLR, 2016
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” NIPS , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NIPS , 2016
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in SIGKDD , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” ICLR , 2017
2017
Earlier work this paper cites.
K. T. Schütt, P.-J. Kindermans, H. E. Sauceda, S. Chmiela, A. Tkatchenko, and K.-R. Müller, “Schnet: A continuous-filter convolutional neural network for modeling quantum interactions,” NIPS , 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” NIPS , 2017
2017
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” NIPS , 2017
2017
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in ICML . PMLR, 2019
2019
Cited alongside, same era.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” in ICLR , 2019
2019
Cited alongside, same era.
J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” NIPS , 2019
2019
Cited alongside, same era.
R. Liao, Z. Zhao, R. Urtasun, and R. S. Zemel, “Lanczosnet: Multi-scale deep graph convolutional networks,” ICLR , 2019
2019
Cited alongside, same era.
L. Zhao, Y. Song, C. Zhang, Y. Liu, P. Wang, T. Lin, M. Deng, and H. Li, “T-gcn: A temporal graph convolutional network for traffic prediction,” IEEE Transactions on Intelligent Transportation Systems , 2019
2019
Cited alongside, same era.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in ICML . PMLR, 2020
2020
Later among the works it cites.
M. Caron, I. Misra, J. Mairal, P. Goyal, P. Bojanowski, and A. Joulin, “Unsupervised learning of visual features by contrasting cluster assignments,” NIPS , 2020
2020
Later among the works it cites.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in CVPR , 2020
2020
Later among the works it cites.
J.-B. Grill, F. Strub, F. Altché, C. Tallec, P. H. Richemond, E. Buchatskaya, C. Doersch, B. A. Pires, Z. D. Guo, M. G. Azar et al. , “Bootstrap your own latent: A new approach to self-supervised learning,” NIPS , 2020
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…
S. Pan, R. Hu, S.-f. Fung, G. Long, J. Jiang, and C. Zhang, “Learning graph embedding with adversarial training methods,” IEEE Transactions on Cybernetics , vol. 50, no. 6, pp. 2475–2487, 2019
2019
Cited alongside, same era.
R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” ICLR , 2019
2019
Cited alongside, same era.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al. , “Pytorch: An imperative style, high-performance deep learning library,” NIPS , 2019
2019
Cited alongside, same era.
F.-Y. Sun, J. Hoffmann, V. Verma, and J. Tang, “Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,” ICLR , 2020
2020
Cited alongside, same era.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Deep graph contrastive representation learning,” ICML , 2020
2020
Cited alongside, same era.
Z. Peng, W. Huang, M. Luo, Q. Zheng, Y. Rong, T. Xu, and J. Huang, “Graph representation learning via graphical mutual information maximization,” in WWW , 2020
2020
Cited alongside, same era.
Y. Jiao, Y. Xiong, J. Zhang, Y. Zhang, T. Zhang, and Y. Zhu, “Sub-graph contrast for scalable self-supervised graph representation learning,” ICDM , 2020
2020
Cited alongside, same era.
2020
Later among the works it cites.
M. Zhang, H. Li, S. Pan, X. Chang, C. Zhou, Z. Ge, and S. W. Su, “One-shot neural architecture search: Maximising diversity to overcome catastrophic forgetting,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Later among the works it cites.
F. Xia, K. Sun, S. Yu, A. Aziz, L. Wan, S. Pan, and H. Liu, “Graph learning: A survey,” IEEE Transactions on Artificial Intelligence , 2021
2021
Closest in time.
S. Wan, S. Pan, P. Zhong, X. Chang, J. Yang, and C. Gong, “Dual interactive graph convolutional networks for hyperspectral image classification,” IEEE Transactions on Geoscience and Remote Sensing , 2021
2021
Closest in time.
Y. Liu, Z. Li, S. Pan, C. Gong, C. Zhou, and G. Karypis, “Anomaly detection on attributed networks via contrastive self-supervised learning,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Closest in time.
Y. Zheng, C. L. Vincent, Z. Wu, and S. Pan, “Heterogeneous graph attention network for small and medium-sized enterprises bankruptcy prediction,” PAKDD , 2021
2021
Closest in time.
2021
Closest in time.
M. Wu, S. Pan, L. Du, and X. Zhu, “Learning graph neural networks with positive and unlabeled nodes,” ACM Transactions on Knowledge Discovery from Data , 2021
2021
Closest in time.
S. Ji, S. Pan, E. Cambria, P. Marttinen, and S. Y. Philip, “A survey on knowledge graphs: Representation, acquisition, and applications,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Closest in time.
M. Jin, Y. Zheng, Y.-F. Li, C. Gong, C. Zhou, and S. Pan, “Multi-scale contrastive siamese networks for self-supervised graph representation learning,” IJCAI , 2021
2021
Closest in time.
S. Wan, S. Pan, J. Yang, and C. Gong, “Contrastive and generative graph convolutional networks for graph-based semi-supervised learning,” in AAAI , 2021
2021
Closest in time.