基于加权超图随机游走的文献关键词提取算法  

Keywords Extraction Algorithm Based on Weighted Hypergraph Random Walk

作　　者：马慧芳 刘芳 夏琴 郝占军 MA Hui-fang;LIU Fang;XIA Qin;HAO Zhan-jun(College of Computer Science and Engineering,Northwest Normal University,Lanzhou,Gansu 730070,China)

机构地区：[1]西北师范大学计算机科学与工程学院,甘肃兰州730070

出　　处：《电子学报》2018年第6期1410-1414,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61762078;No.61363058;No.61762079;No.61762080);中科院智能信息处理重点实验室开放课题(No.IIP2014-4);广西可信软件重点实验室研究课题(No.kx201705)

摘　　要：针对科技文献类标题短文本关键词提取时,已有自然语言处理算法难以建模文献时间与权威性且短文本词语较少建模往往存在高维稀疏问题,本文提出了一个综合实时性以及权威性的关键词提取算法为研究者进行相关推荐.该方法将文献标题视为超边,将标题中不同词项视为超点来构建超图,并对超图中的超边与超点同时加权,进而设计一种基于加权超图随机游走的关键词提取算法对文献标题的词项进行提取.该模型通过对文献来源,发表年份以及被引次数建模来对超边进行加权,根据节点之间的关联度以及每对节点在特定标题中的共现距离对超点加权.最后,通过超图上的随机游走计算出节点的重要性进而确立可推荐的关键词.实验表明,与三种基准短文本关键词提取算法相比,本文算法在精确率和召回率方面均有所提高.It is difficult for the existing natural language processing algorithms to model the time and authority of short texts such as paper titles of scientific literature. Besides,the short texts always tend to have fewer words and thus suffer from high dimension and sparsity. A keyword extraction method involving both real-time and authoritativeness is presented.A weighted hyper-graph is constructed where vertexes represent weighted terms and weighted hyper-edges measure the semantic relatedness of both binary relations and nary relations among terms. On one hand,the source of the documents,the year of publication and number of citations are considered for weighting hyper-edges,on the other hand,the degree of association between the nodes and co-occurrence distance for each pair of nodes in particular title are calculated for weighting hypervertexes. The random walk approach is performed on the weighted hyper-graph to obtain the recommended keywords.Experimental results demonstrated that compared with three baseline algorithms,the proposed approach is able to extract keywords with higher precision and recall.

关 键 词：加权超图 加权策略 关键词推荐 随机游走 自然语言处理 数据挖掘 

分 类 号：TP393.092[自动化与计算机技术—计算机应用技术]