1. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)
2. Cai, H., Zheng, V.W., Chang, K.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE TKDE 30(9), 1616–1637 (2018)
3. Charikar, M., et al.: Approximation algorithms for directed Steiner problems. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25–27 January 1998, San Francisco, California, USA, pp. 192–200. ACM/SIAM (1998)
4. Dridi, A., Gaber, M.M., Azad, R.M.A., Bhogal, J.: Scholarly data mining: a systematic review of its applications. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 11(2), e1395 (2021)
5. Effendy, S., Yap, R.H.C.: Analysing trends in computer science research: a preliminary study using the Microsoft academic graph. In: Proceedings of the 26th International Conference on World Wide Web Companion, Perth, Australia, 3–7 April 2017, pp. 1245–1250. ACM (2017)