TY - GEN
T1 - Meta-path hierarchical heterogeneous graph convolution network for high potential scholar recognition
AU - Wu, Yiqing
AU - Sun, Ying
AU - Zhuang, Fuzhen
AU - Wang, Deqing
AU - Zhang, Xiangliang
AU - He, Qing
N1 - KAUST Repository Item: Exported on 2021-03-02
Acknowledgements: The research work is supported by the National Key Re-search and Development Program of China under Grant No. 2018YFB1004300, the National Natural Science Foundation of China under Grant NOs. U1811461, 61773361, U1836206, the Project of Youth Innovation Promotion Association CAS under Grant No. 2017146.
PY - 2020/11
Y1 - 2020/11
N2 - Recognizing high potential scholars has become an important problem in recent years. However, conventional scholar evaluating methods based on hand-crafted metrics can not profile the scholars in a dynamic and comprehensive way. With the development of online academic databases, large-scale academic activity data become available, which implies detailed information on the scholars' achievement and academic activities. Inspired by the recent success of deep graph neural networks (GNNs), we propose a novel solution to recognize high potential scholars on the dynamic heterogeneous academic network. Specifically, we propose a novel Mate-path Hierarchical Heterogeneous Graph Convolution Network (MHHGCN) to effectively model the heterogeneous graph information. MHHGCN hierarchically aggregates entity and relational information on a set of meta-paths, and can alleviate the information loss problem in the previous heterogenous GNN models. Then to capture the dynamic scholar feature, we combine MHHGCN with Long Short Term Memory (LSTM) network with attention mechanism to model the temporal information and predict the potential scholar. Extensive experimental results on real-world high potential scholar data demonstrate the effectiveness of our approach. Moreover, the model shows high interpretability by visualization of the attention layers.
AB - Recognizing high potential scholars has become an important problem in recent years. However, conventional scholar evaluating methods based on hand-crafted metrics can not profile the scholars in a dynamic and comprehensive way. With the development of online academic databases, large-scale academic activity data become available, which implies detailed information on the scholars' achievement and academic activities. Inspired by the recent success of deep graph neural networks (GNNs), we propose a novel solution to recognize high potential scholars on the dynamic heterogeneous academic network. Specifically, we propose a novel Mate-path Hierarchical Heterogeneous Graph Convolution Network (MHHGCN) to effectively model the heterogeneous graph information. MHHGCN hierarchically aggregates entity and relational information on a set of meta-paths, and can alleviate the information loss problem in the previous heterogenous GNN models. Then to capture the dynamic scholar feature, we combine MHHGCN with Long Short Term Memory (LSTM) network with attention mechanism to model the temporal information and predict the potential scholar. Extensive experimental results on real-world high potential scholar data demonstrate the effectiveness of our approach. Moreover, the model shows high interpretability by visualization of the attention layers.
UR - http://hdl.handle.net/10754/667734
UR - https://ieeexplore.ieee.org/document/9338394/
UR - http://www.scopus.com/inward/record.url?scp=85100901896&partnerID=8YFLogxK
U2 - 10.1109/ICDM50108.2020.00173
DO - 10.1109/ICDM50108.2020.00173
M3 - Conference contribution
SN - 9781728183169
SP - 1334
EP - 1339
BT - 2020 IEEE International Conference on Data Mining (ICDM)
PB - IEEE
ER -