Heterogeneous Graph Learning for Explainable Recommendation over Academic Networks
Not on the map. Why?
Abstract (arXiv)
With the explosive growth of new graduates with research degrees every year, unprecedented challenges arise for early-career researchers to find a job at a suitable institution. This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. Specifically, we design a deep learning model to predict the career move of early-career researchers and provide suggestions. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We construct a heterogeneous scholarly network to facilitate the exploring of the behavior of career moves and the recommendation of institutions for scholars. We devise an unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax) which aggregates attention mechanism and mutual information for institution recommendation. Moreover, we propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths. With these mechanisms, HAI provides ordered recommendations with explainability. We evaluate HAI upon a real-world dataset against baseline methods. Experimental results verify the effectiveness and efficiency of our approach.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 15 of its 40 references that are in the map. First posted on arXiv 16 Feb 2022.
Builds on
15 of 40 references.
References · 15
- 2017Attention Is All You Needcited by 60,361
- 2017Graph Attention Networkscited by 8,923
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2018Deep Graph Infomaxcited by 1,106
- 2019Heterogeneous Graph Attention Networkcited by 734
- 2014Distributed Representations of Sentences and Documentscited by 678
- 2019Graph Transformer Networkscited by 523
- 2021Graph Learning: A Surveycited by 141
- 2017Heterogeneous Information Network Embedding for Recommendationcited by 133
- 2019Heterogeneous Deep Graph Infomaxcited by 42
- 2020Random Walks: A Review of Algorithms and Applicationscited by 38
3 more
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
3 papers.