Heterogeneous Graph Learning for Explainable Recommendation over Academic Networks
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Tokenization: On the Hop-Overpriority Problem in Tokenized Graph Learning Models
Graph World Model
S2FGL: Spatial Spectral Federated Graph Learning
Following the Clues: Experiments on Person Re-ID using Cross-Modal Intelligence
Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.