Fetching the paper…
Reading the bibliography…
Graph representation learning has emerged as a powerful technique for addressing real-world problems.
Collective dynamics of small-world networks
Duncan J Watts and Steven H Strogatz. 1998 · 1998
Earlier work this paper cites.
Models of core/periphery structures
Stephen P Borgatti and Martin G Everett. 2000 · 2000
Earlier work this paper cites.
Statistical mechanics of complex networks
Réka Albert and Albert-László Barabási. 2002 · 2002
Earlier work this paper cites.
SimRank: a measure of structural-context similarity. In KDD ’02 . 538–543
Glen Jeh and Jennifer Widom. 2002 · 2002
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002 · 2002
Earlier work this paper cites.
Superfamilies of evolved and designed networks
Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. 2004 · 2004
Earlier work this paper cites.
Automatic multimedia cross-modal correlation discovery. In KDD ’04 . 653–658
Jia-Yu Pan, Hyung-Jeong Yang, Christos Faloutsos, and Pinar Duygulu. 2004 · 2004
Earlier work this paper cites.
Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD ’05 . 177–187
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2005 · 2005
Earlier work this paper cites.
Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems . 41–50
J Ignacio Alvarez-Hamelin, Luca Dall’Asta, Alain Barrat, and Alessandro Vespignani. 2006 · 2006
Earlier work this paper cites.
Group formation in large social networks: membership, growth, and evolution. In KDD ’06 . 44–54
Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. 2006 · 2006
Earlier work this paper cites.
Dimensionality reduction by learning an invariant mapping. In CVPR ’06 , Vol. 2. IEEE, 1735–1742
Raia Hadsell, Sumit Chopra, and Yann LeCun. 2006 · 2006
Earlier work this paper cites.
Vertex similarity in networks
Elizabeth A Leicht, Petter Holme, and Mark EJ Newman. 2006 · 2006
Earlier work this paper cites.
Sampling from large graphs. In KDD ’06 . 631–636
Jure Leskovec and Christos Faloutsos. 2006 · 2006
Earlier work this paper cites.
Modularity and community structure in networks
Mark EJ Newman. 2006 · 2006
Earlier work this paper cites.
Fast random walk with restart and its applications. In ICDM ’06 . IEEE, 613–622
Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. 2006 · 2006
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike Von Luxburg. 2007 · 2007
Earlier work this paper cites.
Structural holes: The social structure of competition
Ronald S Burt. 2009 · 2009
Earlier work this paper cites.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin. 2011 · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Earlier work this paper cites.
Rolx: structural role extraction & mining in large graphs. In KDD ’12 . 1231–1239
Keith Henderson, Brian Gallagher, Tina Eliassi-Rad, Hanghang Tong, Sugato Basu, Leman Akoglu, Danai Koutra, Christos Faloutsos, and Lei Li. 2012 · 2012
Earlier work this paper cites.
Structural diversity in social contagion
Johan Ugander, Lars Backstrom, Cameron Marlow, and Jon Kleinberg. 2012 · 2012
Cited alongside, same era.
Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems . 3111–3119
Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013 · 2013
Cited alongside, same era.
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
Daniel A Spielman and Shang-Hua Teng. 2013 · 2013
Cited alongside, same era.
Deepwalk: Online learning of social representations. In KDD ’14 . 701–710
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014 · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba. 2015 · 2015
Cited alongside, same era.
struc2vec: Learning node representations from structural identity. In KDD ’17 . 385–394
Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo. 2017 · 2017
Later among the works it cites.
Attention is all you need. In Advances in neural information processing systems . 5998–6008
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017 · 2017
Later among the works it cites.
Relational inductive biases, deep learning, and graph networks
Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, et al · 2018
Later among the works it cites.
Learning structural node embeddings via diffusion wavelets. In KDD ’18 . 1320–1329
Claire Donnat, Marinka Zitnik, David Hallac, and Jure Leskovec. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015 · 2015
Cited alongside, same era.
Deep graph kernels. In KDD ’15 . 1365–1374
Pinar Yanardag and SVN Vishwanathan. 2015 · 2015
Cited alongside, same era.
Defining and evaluating network communities based on ground-truth
Jaewon Yang and Jure Leskovec. 2015 · 2015
Cited alongside, same era.
Panther: Fast top-k similarity search on large networks. In KDD ’15 . 1445–1454
Jing Zhang, Jie Tang, Cong Ma, Hanghang Tong, Yu Jing, and Juanzi Li. 2015 · 2015
Cited alongside, same era.
Higher-order organization of complex networks
Austin R Benson, David F Gleich, and Jure Leskovec. 2016 · 2016
Cited alongside, same era.
node2vec: Scalable feature learning for networks. In KDD ’16 . 855–864
Aditya Grover and Jure Leskovec. 2016 · 2016
Cited alongside, same era.
Benchmark Data Sets for Graph Kernels
Kristian Kersting, Nils M. Kriege, Christopher Morris, Petra Mutzel, and Marion Neumann. 2016 · 2016
Cited alongside, same era.
Aaron van den Oord, Yazhe Li, and Oriol Vinyals. 2018 · 2018
Later among the works it cites.
Graph attention networks
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018 · 2018
Later among the works it cites.
Unsupervised feature learning via non-parametric instance discrimination. In CVPR ’18 . 3733–3742
Zhirong Wu, Yuanjun Xiong, Stella X Yu, and Dahua Lin. 2018 · 2018
Later among the works it cites.
Graph convolutional neural networks for web-scale recommender systems. In KDD ’18 . 974–983
Rex Ying, Ruining He, Kaifeng Chen, Pong Eksombatchai, William L Hamilton, and Jure Leskovec. 2018 · 2018
Later among the works it cites.
An end-to-end deep learning architecture for graph classification. In AAAI ’18
Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018 · 2018
Later among the works it cites.
ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators. In ICLR ’19
Kevin Clark, Minh-Thang Luong, Quoc V Le, and Christopher D Manning. 2019 · 2019
Later among the works it cites.
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL-HLT ’19 . 4171–4186
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019 · 2019
Later among the works it cites.
Unsupervised Pre-Training of Graph Convolutional Networks
Ziniu Hu, Changjun Fan, Ting Chen, Kai-Wei Chang, and Yizhou Sun. 2019a · 2019
Later among the works it cites.
GraLSP: Graph Neural Networks with Local Structural Patterns
Yilun Jin, Guojie Song, and Chuan Shi. 2019 · 2019
Later among the works it cites.
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019 · 2019
Later among the works it cites.
Netsmf: Large-scale network embedding as sparse matrix factorization. In The World Wide Web Conference . 1509–1520
Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Chi Wang, Kuansan Wang, and Jie Tang. 2019 · 2019
Later among the works it cites.
InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization. In ICLR ’19
Fan-Yun Sun, Jordan Hoffman, Vikas Verma, and Jian Tang. 2019 · 2019
Later among the works it cites.
Yonglong Tian, Dilip Krishnan, and Phillip Isola. 2019 · 2019
Later among the works it cites.
Deep graph library: Towards efficient and scalable deep learning on graphs
Minjie Wang, Lingfan Yu, Da Zheng, Quan Gan, Yu Gai, Zihao Ye, Mufei Li, Jinjing Zhou, Qi Huang, Chao Ma, et al · 2019
Later among the works it cites.
How Powerful are Graph Neural Networks?. In ICLR ’19
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019 · 2019
Later among the works it cites.
Momentum contrast for unsupervised visual representation learning. In CVPR ’20 . 9729–9738
Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. 2020 · 2020
Closest in time.