Fetching the paper…
Reading the bibliography…
In recent years, the prevalent online services generate a sheer volume of user activity data.
S. Banach, “Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales,” Fund. math , vol. 3, no. 1, pp. 133–181, 1922
1922
Earlier work this paper cites.
K. Miller, R. Bernstein, and L. Blumenson, “Generalized rayleigh processes,” Quarterly of Applied Mathematics , vol. 16, no. 2, pp. 137–145, 1958
1958
Earlier work this paper cites.
R. E. Kalman, “A new approach to linear filtering and prediction problems,” 1960
1960
Earlier work this paper cites.
A. G. Hawkes, “Spectra of some self-exciting and mutually exciting point processes,” Biometrika , vol. 58, no. 1, pp. 83–90, 1971
1971
Earlier work this paper cites.
V. Isham and M. Westcott, “A self-correcting point process,” Stochastic processes and their applications , vol. 8, no. 3, pp. 335–347, 1979
1979
Earlier work this paper cites.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” nature , vol. 323, no. 6088, pp. 533–536, 1986
1986
Earlier work this paper cites.
Y. LeCun, Y. Bengio et al. , “Convolutional networks for images, speech, and time series,” The handbook of brain theory and neural networks , vol. 3361, no. 10, p. 1995, 1995
1995
Earlier work this paper cites.
K. A. Berman, “Vulnerability of scheduled networks and a generalization of menger’s theorem,” Networks: An International Journal , vol. 28, no. 3, pp. 125–134, 1996
1996
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.
M. W. Gardner and S. Dorling, “Artificial neural networks (the multilayer perceptron)—a review of applications in the atmospheric sciences,” Atmospheric environment , vol. 32, no. 14-15, pp. 2627–2636, 1998
1998
Earlier work this paper cites.
J. A. Suykens and J. Vandewalle, “Least squares support vector machine classifiers,” Neural processing letters , vol. 9, no. 3, pp. 293–300, 1999
1999
Earlier work this paper cites.
D. Kempe, J. Kleinberg, and A. Kumar, “Connectivity and inference problems for temporal networks,” Journal of Computer and System Sciences , vol. 64, no. 4, pp. 820–842, 2002
2002
Earlier work this paper cites.
B. B. Xuan, A. Ferreira, and A. Jarry, “Computing shortest, fastest, and foremost journeys in dynamic networks,” International Journal of Foundations of Computer Science , vol. 14, no. 02, pp. 267–285, 2003
2003
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps for dimensionality reduction and data representation,” Neural computation , vol. 15, no. 6, pp. 1373–1396, 2003
2003
Earlier work this paper cites.
P. Holme, “Network reachability of real-world contact sequences,” Physical Review E , vol. 71, no. 4, p. 046119, 2005
2005
Earlier work this paper cites.
P. Sarkar, S. M. Siddiqi, and G. J. Gordon, “A latent space approach to dynamic embedding of co-occurrence data,” in Artificial Intelligence and Statistics . PMLR, 2007, pp. 420–427
2007
Earlier work this paper cites.
F. Benevenuto, F. Duarte, T. Rodrigues, V. A. Almeida, J. M. Almeida, and K. W. Ross, “Understanding video interactions in youtube,” in Proceedings of the 16th ACM international conference on Multimedia , 2008, pp. 761–764
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE transactions on neural networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
R. Toivonen, L. Kovanen, M. Kivelä, J.-P. Onnela, J. Saramäki, and K. Kaski, “A comparative study of social network models: Network evolution models and nodal attribute models,” Social networks , vol. 31, no. 4, pp. 240–254, 2009
2009
Earlier work this paper cites.
D. Dueck, Affinity propagation: clustering data by passing messages . Citeseer, 2009
2009
Earlier work this paper cites.
Z. Huang and D. K. Lin, “The time-series link prediction problem with applications in communication surveillance,” INFORMS Journal on Computing , vol. 21, no. 2, pp. 286–303, 2009
2009
Earlier work this paper cites.
E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: user movement in location-based social networks,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , 2011, pp. 1082–1090
2011
Earlier work this paper cites.
J. G. Rasmussen, “Temporal point processes: the conditional intensity function,” Lecture Notes, Jan , 2011
2011
Earlier work this paper cites.
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg et al. , “Scikit-learn: Machine learning in python,” the Journal of machine Learning research , vol. 12, pp. 2825–2830, 2011
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” Advances in neural information processing systems , vol. 25, pp. 1097–1105, 2012
2012
Earlier work this paper cites.
P. R. da Silva Soares and R. B. C. Prudêncio, “Time series based link prediction,” in The 2012 international joint conference on neural networks (IJCNN) . IEEE, 2012, pp. 1–7
2012
Earlier work this paper cites.
J. Weaver and P. Tarjan, “Facebook linked data via the graph api,” Semantic Web , vol. 4, no. 3, pp. 245–250, 2013
2013
Earlier work this paper cites.
A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, and A. J. Smola, “Distributed large-scale natural graph factorization,” in Proceedings of the 22nd international conference on World Wide Web , 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 Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
E. Boschee, J. Lautenschlager, S. O’Brien, S. Shellman, J. Starz, and M. Ward, “Integrated crisis early warning system (icews) coded event data,” URL: https://dataverse. harvard. edu/dataverse/icews , 2015
2015
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.
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 , 2015, pp. 1067–1077
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2015
Cited alongside, same era.
A. Zaki, M. Attia, D. Hegazy, and S. Amin, “Comprehensive Survey on Dynamic Graph Models,” International Journal of Advanced Computer Science and Applications , vol. 7, no. 2, 2016
2016
Cited alongside, same era.
2018
Later among the works it cites.
L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” in Concurrency: the Works of Leslie Lamport , 2019, pp. 179–196
2019
Later among the works it cites.
D. Xu, C. Ruan, S. Kumar, E. Korpeoglu, and K. Achan, “Self-attention with functional time representation learning,” 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
R. Trivedi, M. Farajtabar, P. Biswal, and H. Zha, “Dyrep: Learning representations over dynamic graphs,” in International conference on learning representations , 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 , 2016, pp. 1105–1114
2016
Cited alongside, same era.
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
Cited alongside, same era.
S. Cao, W. Lu, and Q. Xu, “Deep neural networks for learning graph representations,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 30, no. 1, 2016
2016
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 , 2016, pp. 1225–1234
2016
Cited alongside, same era.
2016
Cited alongside, same era.
——, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Cited alongside, same era.
İ. Güneş, Ş. Gündüz-Öğüdücü, and Z. Çataltepe, “Link prediction using time series of neighborhood-based node similarity scores,” Data Mining and Knowledge Discovery , vol. 30, no. 1, pp. 147–180, 2016
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” Advances in neural information processing systems , vol. 29, pp. 3844–3852, 2016
2016
Cited alongside, same era.
2019
Later among the works it cites.
L. Zheng, Z. Li, J. Li, Z. Li, and J. Gao, “Addgraph: Anomaly detection in dynamic graph using attention-based temporal gcn.” in IJCAI , 2019, pp. 4419–4425
2019
Later among the works it cites.
A. Taheri, K. Gimpel, and T. Berger-Wolf, “Learning to represent the evolution of dynamic graphs with recurrent models,” in Companion Proceedings of The 2019 World Wide Web Conference , 2019, pp. 301–307
2019
Later among the works it cites.
N. Bastas, T. Semertzidis, A. Axenopoulos, and P. Daras, “evolve2vec: Learning network representations using temporal unfolding,” in International Conference on Multimedia Modeling . Springer, 2019, pp. 447–458
2019
Later among the works it cites.
——, “Predicting dynamic embedding trajectory in temporal interaction networks,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 1269–1278
2019
Later among the works it cites.
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,” Advances in neural information processing systems , vol. 32, pp. 8026–8037, 2019
2019
Later among the works it cites.
M. Wang, L. Yu, D. Zheng, Q. Gan, Y. Gai, Z. Ye, M. Li, J. Zhou, Q. Huang, C. Ma et al. , “Deep graph library: Towards efficient and scalable deep learning on graphs.” 2019
2019
Later among the works it cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE transactions on neural networks and learning systems , 2020
2020
Later among the works it cites.
N. Masuda and R. Lambiotte, Guide To Temporal Networks, A . World Scientific, 2020, vol. 6
2020
Later among the works it cites.
A. Sankar, Y. Wu, L. Gou, W. Zhang, and H. Yang, “Dysat: Deep neural representation learning on dynamic graphs via self-attention networks,” in Proceedings of the 13th International Conference on Web Search and Data Mining , 2020, pp. 519–527
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
S. M. Kazemi, R. Goel, K. Jain, I. Kobyzev, A. Sethi, P. Forsyth, and P. Poupart, “Representation learning for dynamic graphs: A survey.” Journal of Machine Learning Research , vol. 21, no. 70, pp. 1–73, 2020
2020
Later among the works it cites.
Y. Ma, Z. Guo, Z. Ren, J. Tang, and D. Yin, “Streaming graph neural networks,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2020, pp. 719–728
2020
Later among the works it cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Later among the works it cites.
F. Manessi, A. Rozza, and M. Manzo, “Dynamic graph convolutional networks,” Pattern Recognition , vol. 97, p. 107000, 2020
2020
Later among the works it cites.
A. Pareja, G. Domeniconi, J. Chen, T. Ma, T. Suzumura, H. Kanezashi, T. Kaler, T. Schardl, and C. Leiserson, “Evolvegcn: Evolving graph convolutional networks for dynamic graphs,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 5363–5370
2020
Later among the works it cites.
T. Bogaerts, A. D. Masegosa, J. S. Angarita-Zapata, E. Onieva, and P. Hellinckx, “A graph cnn-lstm neural network for short and long-term traffic forecasting based on trajectory data,” Transportation Research Part C: Emerging Technologies , vol. 112, pp. 62–77, 2020
2020
Later among the works it cites.
X. Chang, X. Liu, J. Wen, S. Li, Y. Fang, L. Song, and Y. Qi, “Continuous-time dynamic graph learning via neural interaction processes,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management , 2020, pp. 145–154
2020
Later among the works it cites.
2020
Later among the works it cites.
Z. Jia, S. Lin, M. Gao, M. Zaharia, and A. Aiken, “Improving the accuracy, scalability, and performance of graph neural networks with roc,” Proceedings of Machine Learning and Systems , vol. 2, pp. 187–198, 2020
2020
Later among the works it cites.
C. Gallicchio and A. Micheli, “Fast and deep graph neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 3898–3905
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Skardinga, B. Gabrys, and K. Musial, “Foundations and modelling of dynamic networks using dynamic graph neural networks: A survey,” IEEE Access , 2021
2021
Later among the works it cites.
X. Wang, D. Lyu, M. Li, Y. Xia, Q. Yang, X. Wang, X. Wang, P. Cui, Y. Yang, B. Sun et al. , “Apan: Asynchronous propagation attention network for real-time temporal graph embedding,” in Proceedings of the 2021 International Conference on Management of Data , 2021, pp. 2628–2638
2021
Later among the works it cites.
C. Wang, S. Cai, and G. Tan, “Graphtcn: Spatio-temporal interaction modeling for human trajectory prediction,” in Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , 2021, pp. 3450–3459
2021
Later among the works it cites.
Y.-H. Chen and J.-T. Chien, “Continuous-time attention for sequential learning,” in Proc. of AAAI Conference on Aritificial Intelligence , 2021
2021
Later among the works it cites.
Y. Bai, C. Li, Z. Lin, Y. Wu, Y. Miao, Y. Liu, and Y. Xu, “Efficient data loader for fast sampling-based gnn training on large graphs,” IEEE Transactions on Parallel and Distributed Systems , vol. 32, no. 10, pp. 2541–2556, 2021
2021
Later among the works it cites.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in International conference on machine learning . PMLR, 2016, pp. 2014–2023
2023
Closest in time.