Fetching the paper…
Reading the bibliography…
Recently, transformers have shown promising performance in learning graph representations.
H. Kashima, K. Tsuda, and A. Inokuchi, “Marginalized kernels between labeled graphs,” in Proceedings of the 20th international conference on machine learning (ICML-03) , 2003, pp. 321–328
2003
Earlier work this paper cites.
K. M. Borgwardt and H.-P. Kriegel, “Shortest-path kernels on graphs,” in Fifth IEEE international conference on data mining (ICDM’05) . IEEE, 2005, pp. 8–pp
2005
Earlier work this paper cites.
N. Pržulj, “Biological network comparison using graphlet degree distribution,” Bioinformatics , vol. 23, no. 2, pp. e177–e183, 2007
2007
Earlier work this paper cites.
N. Shervashidze, S. Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt, “Efficient graphlet kernels for large graph comparison,” in Artificial intelligence and statistics . PMLR, 2009, pp. 488–495
2009
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels.” Journal of Machine Learning Research , vol. 12, no. 9, 2011
2011
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.
S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural information,” in Proceedings of the 24th ACM international on conference on information and knowledge management , 2015, pp. 891–900
2015
Earlier work this paper cites.
P. Yanardag and S. Vishwanathan, “Deep graph kernels,” in Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining , 2015, pp. 1365–1374
2015
Earlier work this paper cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in International conference on machine learning . PMLR, 2016, pp. 40–48
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
K. Kersting, N. M. Kriege, C. Morris, P. Mutzel, and M. Neumann, “Benchmark data sets for graph kernels,” 2016. [Online]. Available: http://graphkernels.cs.tu-dortmund.de
2016
Earlier work this paper cites.
2017
Earlier work this paper cites.
L. F. Ribeiro, P. H. Saverese, and D. R. Figueiredo, “struc2vec: Learning node representations from structural identity,” in Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining , 2017, pp. 385–394
2017
Earlier work this paper cites.
X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, “Neural collaborative filtering,” in Proceedings of the 26th international conference on world wide web , 2017, pp. 173–182
2017
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” stat , vol. 1050, p. 20, 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Advances in neural information processing systems , 2017, pp. 5998–6008
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
Z. Wu, B. Ramsundar, E. N. Feinberg, J. Gomes, C. Geniesse, A. S. Pappu, K. Leswing, and V. Pande, “Moleculenet: a benchmark for molecular machine learning,” Chemical science , vol. 9, no. 2, pp. 513–530, 2018
2018
Earlier work this paper cites.
R. Gómez-Bombarelli, J. N. Wei, D. Duvenaud, J. M. Hernández-Lobato, B. Sánchez-Lengeling, D. Sheberla, J. Aguilera-Iparraguirre, T. D. Hirzel, R. P. Adams, and A. Aspuru-Guzik, “Automatic chemical design using a data-driven continuous representation of molecules,” ACS central science , vol. 4, no. 2, pp. 268–276, 2018
2018
Earlier work this paper cites.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in Thirty-Second AAAI conference on artificial intelligence , 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
B. Adhikari, Y. Zhang, N. Ramakrishnan, and B. A. Prakash, “Sub2vec: Feature learning for subgraphs,” in Pacific-Asia Conference on Knowledge Discovery and Data Mining . Springer, 2018, pp. 170–182
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2020
Later among the works it cites.
A. Katharopoulos, A. Vyas, N. Pappas, and F. Fleuret, “Transformers are rnns: Fast autoregressive transformers with linear attention,” in International Conference on Machine Learning . PMLR, 2020, pp. 5156–5165
2020
Later among the works it cites.
N. Carion, F. Massa, G. Synnaeve, N. Usunier, A. Kirillov, and S. Zagoruyko, “End-to-end object detection with transformers,” in European Conference on Computer Vision . Springer, 2020, pp. 213–229
2020
Later among the works it cites.
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…
W.-C. Kang and J. McAuley, “Self-attentive sequential recommendation,” in 2018 IEEE International Conference on Data Mining (ICDM) . IEEE, 2018, pp. 197–206
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” ICLR (Poster) , vol. 2, no. 3, p. 4, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
L. Wu, S. Li, C.-J. Hsieh, and J. Sharpnack, “Sse-pt: Sequential recommendation via personalized transformer,” in Fourteenth ACM Conference on Recommender Systems , 2020, pp. 328–337
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
B. Rozemberczki, C. Allen, and R. Sarkar, “Multi-scale attributed node embedding,” Journal of Complex Networks , vol. 9, no. 2, p. cnab014, 2021
2021
Later among the works it cites.
S. Zhang, H. Chen, X. Ming, L. Cui, H. Yin, and G. Xu, “Where are we in embedding spaces?” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , 2021, pp. 2223–2231
2021
Later among the works it cites.
D.-H. Zhu, X.-Y. Dai, and J.-J. Chen, “Pre-train and learn: Preserving global information for graph neural networks,” Journal of Computer Science and Technology , vol. 36, no. 6, pp. 1420–1430, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
H. Touvron, M. Cord, M. Douze, F. Massa, A. Sablayrolles, and H. Jégou, “Training data-efficient image transformers & distillation through attention,” in International Conference on Machine Learning . PMLR, 2021, pp. 10 347–10 357
2021
Later among the works it cites.
2021
Later among the works it cites.
Z. Fan, Z. Liu, J. Zhang, Y. Xiong, L. Zheng, and P. S. Yu, “Continuous-time sequential recommendation with temporal graph collaborative transformer,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management , 2021, pp. 433–442
2021
Later among the works it cites.
2021
Later among the works it cites.
D. Buffelli and F. Vandin, “The impact of global structural information in graph neural networks applications,” Data , vol. 7, no. 1, p. 10, 2022
2022
Closest in time.
——, “Graph contrastive learning with adaptive augmentation,” in Proceedings of the Web Conference 2021 , 2021, pp. 2069–2080
2080
Closest in time.