一种基于关联关系的有向网络关键节点挖掘算法  

Key Nodes Mining Algorithm Based on Association with Directed Network

作　　者：梁莹莹 黄岚[1,2,3] 王喆 LlANG Ying-ying;HUANG Lan;WANG Zhe(College of Computer Science and Technology,Jilin University,Changchun130012,China;Key Laboratory of Symbolic Computation and Knowledge Engineering(Jilin University),Ministry of Education,Changchun130012,China;Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education,Department of Computer Science and Technology,Zhuhai College of Jilin University,Zhuhai519041,China)

机构地区：[1]吉林大学计算机科学与技术学院,长春130012 [2]符号计算与知识工程教育部重点实验室(吉林大学),长春130012 [3]吉林大学珠海学院计算机系教育部符号计算与知识工程实验室,珠海519041

出　　处：《计算机科学》2017年第12期23-27,共5页Computer Science

基　　金：国家自然科学基金项目(61373051;61472159);吉林省电子商务关键支撑技术工程实验室创新能力项目资助

摘　　要：关键节点在网络中的重要程度高于其他大部分节点,关键节点挖掘是网络分析的重要研究内容,对网络结构和网络中的关系等研究而言都具有非常重要的意义。已有的关键节点挖掘算法从不同的侧重点进行节点关键性评价,文中基于网络中节点的局部性信息,结合节点与其一阶邻居节点的关联关系,提出了一种有向网络关键节点挖掘算法。该算法在关注节点所处局部环境的同时考虑关联节点间的关联强度及重要性影响,根据局部重要性和关联重要性共同进行关键节点的评价。在实验网络上的影响力传播实验表明,相比于经典的度中心性等关键节点评价算法,所提算法挖掘得到的关键节点对影响力的传播能力更强,说明了算法的准确性。The importance of key nodes in the network is higher than most other nodes,and key nodes mining is an importantresearch area of network analysis.It is of great significance for study of network,such as study of network structure,network relations and so on.Many key nodes mining algorithmse valuate key nodes from different emphases.In this paper,we proposed a key nodes mining algorithm based on association with directed network,combining nodes'partial information and association with neighbors in the network.This algorithm calculates the local centrality of nodes at first.In addition,it also calculates the association centrality between associated nodes based on nodes'local centrality and the strength of association at the same time.In order to measure the accuracy of the key nodes mining algorithm,we designed influence propagation experiment to test the algorithm.Results show that compared with the classical centrality and other key nodes mining algorithms,key nodes mined by our algorithm have higher ability to spread influence in experimental network,which also illustrates the accuracy of our algorithm.

关 键 词：有向网络 中心性 关联关系 关键节点 影响力传播 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]