Higher-order link prediction via time-aware dynamic embedding learning

Graphical abstract

References

[1] Benson A R, Abebe R, Schaub M T, Jadbabaie A, Kleinberg J . Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences of the United States of America, 2018, 115( 48): E11221–E11230

[2] Mikolov T, Sutskever I, Chen K, Corrado G, Dean J. Distributed representations of words and phrases and their compositionality. In: Proceedings of the 27th International Conference on Neural Information Processing Systems. 2013, 3111−3119

[3] Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez A N, Kaiser Ł, Polosukhin I. Attention is all you need. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. 2017, 6000−6010

[4] Perozzi B, Al-Rfou R, Skiena S. DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2014, 701–710

[5] Jung-Muller M, Ceria A, Wang H. Higher-order temporal network prediction. In: Proceedings of the 12th International Conference on Complex Networks and Their Applications. 2023, 461–472

[6] Liu J, Hua Z, Xie Y, Li B, Shomer H, Song Y, Hassani K, Tang J. Higher-order structure boosts link prediction on temporal graphs. 2025, arXiv preprint arXiv: 2505.15746

[7] Zhao Z, Yang K, Guo J . Link prediction with hypergraphs via network embedding. Applied Sciences, 2022, 13( 1): 523

[8] Zhang M, Xu B, Wang L . Dynamic network link prediction based on random walking and time aggregation. International Journal of Machine Learning and Cybernetics, 2023, 14( 8): 2867–2875

RIGHTS & PERMISSIONS

Higher Education Press