Measuring Academic Representative Papers Based on Graph Autoencoder Framework

被引:0
作者
Zhang, Xiaolu [1 ]
Ma, Mingyuan [2 ]
机构
[1] City Univ Hong Kong, Dept Informat Syst, Hong Kong, Peoples R China
[2] Peking Univ, Sch Comp Sci, Key Lab High Confidence Software Technol, Minist Educ, Beijing 100871, Peoples R China
基金
中国国家自然科学基金;
关键词
graph neural networks; heterogeneous network; impact measurement; graph autoencoder; TRANSFORMER NETWORKS;
D O I
10.3390/electronics12020398
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Objectively evaluating representative papers in a specific scientific research field is of great significance to the development of academia and scientific research institutions. Representative papers on achievements in scientific research can reflect the academic level and research characteristics of researchers and research institutions. The existing research methods are mainly based on external feature indicators and citation analysis methods, and the method of combining artificial intelligence is in its infancy. From the perspective of scientific research institutions, this paper proposes a graph autoencoder framework based on heterogeneous networks for the measurement of paper impact, named GAEPIM. Specifically, we propose two versions of GAEPIM based on a graph convolutional network and graph transformer network. The models rank papers in a specific research field and find the most representative papers and their scientific institutions. The proposed framework constructs a heterogeneous network of papers, institutions, and venues and simultaneously analyzes the semantic information of papers and the heterogeneous network structural information. Finally, based on the complex network information diffusion model, the proposed method performs better than several widely used baseline methods.
引用
收藏
页数:17
相关论文
共 41 条
  • [1] [Anonymous], Citation Network Dataset: DBLP+Citation, ACM Citation network
  • [2] Identifying Your Representative Work Based on Credit Allocation
    Bao, Peng
    Wang, Jiahui
    [J]. COMPANION PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2018 (WWW 2018), 2018, : 5 - 6
  • [3] Finding key players in complex networks through deep reinforcement learning
    Fan, Changjun
    Zeng, Li
    Sun, Yizhou
    Liu, Yang-Yu
    [J]. NATURE MACHINE INTELLIGENCE, 2020, 2 (06) : 317 - 324
  • [4] CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION
    FREEMAN, LC
    [J]. SOCIAL NETWORKS, 1979, 1 (03) : 215 - 239
  • [5] CITATION INDEXES FOR SCIENCE - NEW DIMENSION IN DOCUMENTATION THROUGH ASSOCIATION OF IDEAS
    GARFIELD, E
    [J]. SCIENCE, 1955, 122 (3159) : 108 - 111
  • [6] Geng S., 2018, INFORM STUDIES THEOR, V41, P93
  • [7] node2vec: Scalable Feature Learning for Networks
    Grover, Aditya
    Leskovec, Jure
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 855 - 864
  • [8] Jiang C., 2014, INF DOC SERV, V198, P31
  • [9] Jiang L., 2014, RES EVALUATION INDEX
  • [10] [姜霖 Jiang Lin], 2020, [数据分析与知识发现, Data Analysis and Knowledge Discovery], V4, P129