Meta-path Hierarchical Heterogeneous Graph Convolution Network for High Potential Scholar Recognition

被引:3
作者
Wu, Yiqing [1 ,2 ]
Sun, Ying [1 ,2 ]
Zhuang, Fuzhen [1 ,2 ]
Wang, Deqing [3 ]
Zhang, Xiangliang [4 ]
He, Qing [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[3] Beihang Univ, Sch Comp Sci & Engn, Beijing, Peoples R China
[4] King Abdullah Univ Sci & Technol, Thuwal, Saudi Arabia
来源
20TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2020) | 2020年
基金
中国国家自然科学基金;
关键词
High Potential Scholar; Graph Neural Network; Heterogeneous Graph;
D O I
10.1109/ICDM50108.2020.00173
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 metapaths, 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.
引用
收藏
页码:1334 / 1339
页数:6
相关论文
共 17 条
  • [1] [Anonymous], 2009, Structural holes: The social structure of competition
  • [2] BAVELAS A, 1950, J ACOUST SOC AM, V22, P723
  • [3] BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631
  • [4] Mining the web's link structure
    Chakrabarti, S
    Dom, BE
    Kumar, SR
    Raghavan, P
    Rajagopalan, S
    Tomkins, A
    Gibson, D
    Kleinberg, J
    [J]. COMPUTER, 1999, 32 (08) : 60 - +
  • [5] Chang C.C., 2011, ACM T INTEL SYST TEC, V2, P27, DOI DOI 10.1145/1961189.1961199
  • [6] Fan RE, 2008, J MACH LEARN RES, V9, P1871
  • [7] User Profiling through Deep Multimodal Fusion
    Farnadi, Golnoosh
    Tang, Jie
    De Cock, Martine
    Moens, Marie-Francine
    [J]. WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2018, : 171 - 179
  • [8] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1162/neco.1997.9.8.1735, 10.1007/978-3-642-24797-2, 10.1162/neco.1997.9.1.1]
  • [9] Hamilton WL, 2017, ADV NEUR IN, V30
  • [10] An index to quantify an individual's scientific research output
    Hirsch, JE
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (46) : 16569 - 16572