Fetching the paper…
Reading the bibliography…
In network representation learning we learn how to represent heterogeneous information networks in a low-dimensional space so as to facilitate effective search, classification, and prediction solutions.
Bonacich and Phillip, “Power and centrality: A family of measures,” American Journal of Sociology , vol. 92, no. 5, pp. 1170–1182, 1987
1987
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps and spectral techniques for embedding and clustering,” in NeurIPS , 2001, pp. 585–591
2001
Earlier work this paper cites.
M. A. A. Cox and T. F. Cox, Multidimensional Scaling . Springer Berlin Heidelberg, 2008
2008
Earlier work this paper cites.
Y. Sun and J. Han, Mining Heterogeneous Information Networks: Principles and Methodologies , ser. Synthesis Lectures on Data Mining and Knowledge Discovery. Morgan & Claypool Publishers, 2012
2012
Earlier work this paper cites.
A. Ahmed, N. Shervashidze, S. M. Narayanamurthy, V. Josifovski, and A. J. Smola, “Distributed large-scale natural graph factorization,” in WWW , 2013, pp. 37–48
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: online learning of social representations,” in KDD , 2014, pp. 701–710
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” in ICLR , 2014
2014
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “LINE: large-scale information network embedding,” in WWW , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
A. M. Dai and Q. V. Le, “Semi-supervised sequence learning,” in NeurIPS , 2015, pp. 3079–3087
2015
Earlier work this paper cites.
J. Tang, M. Qu, and Q. Mei, “PTE: predictive text embedding through large-scale heterogeneous text networks,” in KDD , 2015, pp. 1165–1174
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in KDD , 2016, pp. 855–864
2016
Earlier work this paper cites.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in KDD , 2016, pp. 1225–1234
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in NeurIPS , 2016, pp. 3837–3845
2016
Earlier work this paper cites.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in KDD , 2017, pp. 135–144
2017
Cited alongside, same era.
2017
Cited alongside, same era.
T. Fu, W. Lee, and Z. Lei, “Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning,” in CIKM , 2017, pp. 1797–1806
2017
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Cited alongside, same era.
F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in CVPR , 2017, pp. 5425–5434
2018
Later among the works it cites.
C. Zhang, D. Song, C. Huang, A. Swami, and N. V. Chawla, “Heterogeneous graph neural network,” in KDD , 2019, pp. 793–803
2019
Later among the works it cites.
R. Levie, F. Monti, X. Bresson, and M. M. Bronstein, “Cayleynets: Graph convolutional neural networks with complex rational spectral filters,” IEEE Trans. Signal Process. , vol. 67, no. 1, pp. 97–109, 2019
2019
Later among the works it cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in ICLR , 2019
2019
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.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017, pp. 1024–1034
2017
Cited alongside, same era.
H. Cai, V. W. Zheng, and K. C. Chang, “A comprehensive survey of graph embedding: Problems, techniques, and applications,” IEEE Trans. Knowl. Data Eng. , vol. 30, no. 9, pp. 1616–1637, 2018
2018
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Cited alongside, same era.
M. E. Peters, M. Neumann, M. Iyyer, M. Gardner, C. Clark, K. Lee, and L. Zettlemoyer, “Deep contextualized word representations,” in NAACL-HLT , 2018, pp. 2227–2237
2018
Cited alongside, same era.
J. Howard and S. Ruder, “Universal language model fine-tuning for text classification,” in ACL , 2018, pp. 328–339
2018
Cited alongside, same era.
R. Li, S. Wang, F. Zhu, and J. Huang, “Adaptive graph convolutional neural networks,” in AAAI , 2018, pp. 3546–3553
2018
Cited alongside, same era.
H. Gao, Z. Wang, and S. Ji, “Large-scale learnable graph convolutional networks,” in KDD , 2018, pp. 1416–1424
2018
Cited alongside, same era.
2019
Later among the works it cites.
J. Devlin, M. Chang, K. Lee, and K. Toutanova, “BERT: pre-training of deep bidirectional transformers for language understanding,” in NAACL-HLT , 2019, pp. 4171–4186
2019
Later among the works it cites.
R. Reinanda, E. Meij, and M. de Rijke, “Knowledge graphs: An information retrieval perspective,” Foundations and Trends in Information Retrieval , vol. 14, no. 4, pp. 289–444, October 2020
2020
Closest in time.
J. Qiu, Q. Chen, Y. Dong, J. Zhang, H. Yang, M. Ding, K. Wang, and J. Tang, “GCC: graph contrastive coding for graph neural network pre-training,” in KDD , 2020, pp. 1150–1160
2020
Closest in time.
Z. Hu, Y. Dong, K. Wang, K. Chang, and Y. Sun, “GPT-GNN: generative pre-training of graph neural networks,” in KDD , 2020, pp. 1857–1867
2020
Closest in time.
Z. Hu, Y. Dong, K. Wang, and Y. Sun, “Heterogeneous graph transformer,” in WWW , 2020, pp. 2704–2710
2020
Closest in time.
F. Sun, J. Hoffmann, V. Verma, and J. Tang, “Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,” in ICLR , 2020
2020
Closest in time.
W. Hu, B. Liu, J. Gomes, M. Zitnik, P. Liang, V. S. Pande, and J. Leskovec, “Strategies for pre-training graph neural networks,” in ICLR , 2020
2020
Closest in time.
D. Hwang, J. Park, S. Kwon, K. Kim, J. Ha, and H. J. Kim, “Self-supervised auxiliary learning with meta-paths for heterogeneous graphs,” in NeurIPS , 2020
2020
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in ICML , 2016, pp. 2014–2023
2023
Closest in time.