K-Core based Temporal Graph Convolutional Network for Dynamic Graphs

P. Jaccard, “Étude comparative de la distribution florale dans une portion des alpes et des jura,” Bull Soc Vaudoise Sci Nat , vol. 37, pp. 547–579, 1901

1901

Earlier work this paper cites.

B. Xu, H. Shen, Q. Cao, K. Cen, and X. Cheng, “Graph convolutional networks using heat kernel for semi-supervised learning,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence . AAAI Press, 2019, pp. 1928–1934

1934

Earlier work this paper cites.

S. B. Seidman, “Network structure and minimum degree,” Social networks , vol. 5, no. 3, pp. 269–287, 1983

1983

Earlier work this paper cites.

D. W. Matula and L. L. Beck, “Smallest-last ordering and clustering and graph coloring algorithms,” Journal of the ACM (JACM) , vol. 30, no. 3, pp. 417–427, 1983

1983

Earlier work this paper cites.

K. Hornik, “Approximation capabilities of multilayer feedforward networks,” Neural networks , vol. 4, no. 2, pp. 251–257, 1991

1991

Earlier work this paper cites.

S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997

1997

Earlier work this paper cites.

G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , 2002, pp. 538–543

2002

Earlier work this paper cites.

V. Batagelj and M. Zaversnik, “An o (m) algorithm for cores decomposition of networks,” arXiv , vol. cs.DS/0310049, 2003

2003

Earlier work this paper cites.

L. v. d. Maaten and G. Hinton, “Visualizing data using t-sne,” Journal of machine learning research , vol. 9, no. Nov, pp. 2579–2605, 2008

Original

2003

Earlier work this paper cites.

M. Barthelemy, “Betweenness centrality in large complex networks,” The European physical journal B , vol. 38, no. 2, pp. 163–168, 2004

2004

Earlier work this paper cites.

E. A. Leicht, P. Holme, and M. E. Newman, “Vertex similarity in networks,” Physical Review E , vol. 73, no. 2, p. 026120, 2006

2006

Earlier work this paper cites.

K. Okamoto, W. Chen, and X.-Y. Li, “Ranking of closeness centrality for large-scale social networks,” in International workshop on frontiers in algorithmics . Springer, 2008, pp. 186–195

2008

Earlier work this paper cites.

M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse, “Identification of influential spreaders in complex networks,” Nature physics , vol. 6, no. 11, pp. 888–893, 2010

2010

Earlier work this paper cites.

T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimation of word representations in vector space,” arXiv , vol. abs/1301.3781, 2013

Original

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 . ACM, 2014, pp. 701–710

2014

Earlier work this paper cites.

K. Cho, B. Van Merriënboer, C. Gulcehre, D. Bahdanau, F. Bougares, H. Schwenk, and Y. Bengio, “Learning phrase representations using rnn encoder-decoder for statistical machine translation,” arXiv , vol. abs/1406.1078, 2014

Original

2014

Earlier work this paper cites.

D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv , vol. abs/1412.6980, 2014

Original

2014

Earlier work this paper cites.

C. Yang, Z. Liu, D. Zhao, M. Sun, and E. Chang, “Network representation learning with rich text information,” in Twenty-Fourth International Joint Conference on Artificial Intelligence , 2015

2015

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 Proceedings of the 24th international conference on world wide web . International World Wide Web Conferences Steering Committee, 2015, pp. 1067–1077

2015

Earlier work this paper cites.

G. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,” arXiv , vol. abs/1503.02531, 2015

Original

2015

Earlier work this paper cites.

P. Bonacich and P. Lloyd, “Eigenvector centrality and structural zeroes and ones: When is a neighbor not a neighbor?” Social Networks , vol. 43, pp. 86–90, 2015

2015

Cited alongside, same era.

D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2016, pp. 1225–1234

2016

Cited alongside, same era.

M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in neural information processing systems , 2016, pp. 3844–3852

2016

Cited alongside, same era.

M. Ou, P. Cui, J. Pei, Z. Zhang, and W. Zhu, “Asymmetric transitivity preserving graph embedding,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2016, pp. 1105–1114

2016

Cited alongside, same era.

P. Goyal, N. Kamra, X. He, and Y. Liu, “Dyngem: Deep embedding method for dynamic graphs,” arXiv , vol. abs/1805.11273, 2018

Original

2018

Later among the works it cites.

Z. Zhang, P. Cui, J. Pei, X. Wang, and W. Zhu, “Timers: Error-bounded svd restart on dynamic networks,” in Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence , 2018, pp. 224–231

2018

Later among the works it cites.

Y. Zuo, G. Liu, H. Lin, J. Guo, X. Hu, and J. Wu, “Embedding temporal network via neighborhood formation,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2018, pp. 2857–2866

2018

Later among the works it cites.

Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence , 2018, pp. 3538–3545

2018

Later among the works it cites.