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

一种基于关联关系的有向网络关键节点 挖掘算法 梁莹莹黄岚王詰 吉林大学计算机科学与技术学院符号计算与知识工 程教育部重点实验室（吉林大学）吉林大学珠海学院 计算机系教育部符号计算与知识工程实验室 摘要： 关键节点在网络中的重要程度高于其他人部分节点，关键节点挖掘是网络分析 的重要研究内容，对网络结构和网络屮的关系等研究而言都具有非常重要的意 义。已有的关键节点挖掘算法从不同的侧重点进行节点关键性评价，文中基于网 络中节点的局部性信息，结合节点与其一阶邻居节点的关联关系，提出了一种 有向网络关键节点挖掘算法。该算法在关注节点所处局部环境的同时考虑关联节 点间的关联强度及重要性影响，根据局部重要性和关联重要性共同进行关键节 点的评价。在实验网络上的影响力传播实验表明，相比于经典的度中心性等关键 节点评价算法，所提算法挖掘得到的关键节点对影响力的传播能力更强，说明 了算法的准确性。 关键词： 有向网络;屮心性;关联关系;关键节点;影响力传播; 作者简介：梁莹莹（1993-），女，硕士，主要研究方向为社交网络分析； 作者简介：黄岚（1974-），女，博士，教授，主要研究方向为数据挖掘和商务 智能； 作者简介：王詰（1974-）,男，博士，副教授，主要研究方向为社交媒体挖掘, E-mai 1: wz2000@jlu. edu. cn （通信作者）。 收稿日期：2016-10-11 基金：国家自然科学基金项目 Key Nodes Mining Algorithm Based on Association with Directed Network LIANG Ying-ying HUANG Lan WANG Zhe College of Computer Science and Technology, Jilin University; Abstract： The importance of key nodes in the network is higher than most other nodes, and key nodes mining is an important research area of network analysis. It is of great significanee for study of network, such as study of network structure, network relations and so on. Many key nodes mining algorithms evaluate 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 accurac)^ of the key nodes mining algorithm, we designed influence propagation experiment to test the algori thm. Results show that compared with the classical cent ral ity and ot her key nodes mining algor it hms, key nodes mined by our algorithm have higher ability to spread influence in experimental net work, which also illustrates the accuracy of our algorithm. Keyword： Directed network; Centrality; Associat