• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Meta-path hierarchical heterogeneous graph convolution network for high potential scholar recognition

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    ICDM2020-wu.pdf
    Size:
    236.7Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Conference Paper
    Authors
    Wu, Yiqing
    Sun, Ying
    Zhuang, Fuzhen
    Wang, Deqing
    Zhang, Xiangliang cc
    He, Qing
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2020-11
    Permanent link to this record
    http://hdl.handle.net/10754/667734
    
    Metadata
    Show full item record
    Abstract
    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.
    Citation
    Wu, Y., Sun, Y., Zhuang, F., Wang, D., Zhang, X., & He, Q. (2020). Meta-Path Hierarchical Heterogeneous Graph Convolution Network for High Potential Scholar Recognition. 2020 IEEE International Conference on Data Mining (ICDM). doi:10.1109/icdm50108.2020.00173
    Sponsors
    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.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Conference/Event name
    20th IEEE International Conference on Data Mining, ICDM 2020
    ISBN
    9781728183169
    DOI
    10.1109/ICDM50108.2020.00173
    Additional Links
    https://ieeexplore.ieee.org/document/9338394/
    ae974a485f413a2113503eed53cd6c53
    10.1109/ICDM50108.2020.00173
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.