基于网络表示学习的论文影响力预测算法  

Paper Influence Prediction Algorithm Based on Network Representation Learning

作　　者：樊玮[1] 韩佳宁 张宇翔[1] FAN Wei;HAN Jianing;ZHANG Yuxiang(College of Computer Science and Technology,Civil Aviation University of China,Tianjin 300300,China)

机构地区：[1]中国民航大学计算机科学与技术学院

出　　处：《计算机工程》2019年第12期160-165,170,共7页Computer Engineering

基　　金：国家自然科学基金(U1333109,U1533104);中央高校基本科研业务费专项资金(ZXH2012P009)

摘　　要：基于图的随机游走算法在预测论文影响力时,仅利用学术网络的全局结构信息而未考虑局部结构信息,对预测准确率造成影响。针对该问题,提出一种基于异构学术网络表示学习和多变量随机游走的论文影响力预测算法。通过构建异构学术网络表示模型,将网络中的论文、作者和期刊/会议等不同类型的节点表征到同一个低维向量空间中,同时保留网络的局部结构信息,将节点的向量相似度应用于多变量随机游走方法,实现对论文影响力的准确预测。在AMiner网站公开数据集上的实验结果表明,相比于PageRank、FutureRank等算法,该算法的预测准确性较高。The graph-based random walk algorithm for paper influence prediction exploits only global structural information of academic network,and local structural information is usually ignored,which influence the prediction accuracy.To address the problem,this paper proposes a paper influence prediction algorithm based on heterogeneous academic network representation learning and multivariate random walk.By constructing a heterogeneous academic network representation model,different kinds of nodes of paper,authors,and journals/conferences in the network are represented into the same low-dimensional vector space,and the local structural information of network is kept.Similarity between vectors is applied to multivariate random walk to implement the accurate paper influence prediction.Experimental results on public datasets of AMiner Website show that the proposed method is more accurate in prediction than PageRank,FutureRank and other algorithms.

关 键 词：网络表示学习 影响力预测 异构学术网络 多变量随机游走 局部结构信息 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]