一种基于最短路径介数的重要节点发现算法  

Important node searching algorithm based on shortest-path betweeness

作　　者：张珍[1] 张振宇[1] 宋蔓蔓[1] 

机构地区：[1]新疆大学信息科学与工程学院计算机科学系,乌鲁木齐830000

出　　处：《计算机工程与应用》2013年第21期98-100,132,共4页Computer Engineering and Applications

摘　　要：网络中重要节点的发现是研究网络特性的重要方面之一,在复杂网络、系统科学、社会网分析和互联网搜索等领域中具有广泛的应用价值。为提高全网范围内重要节点发现的效率和有效性,提出了一种基于最短路径介数及节点中心接近度的重要节点发现算法,通过最短路径介数的方法确定全网内的重要节点,利用中心接近度分析重要节点的重要性。测试结果表明,与同类的系统比较起来,该方法具有比较好的性能。Finding important nodes in network is one of the most important topics of studying the properties of network, which is widely used in complex network, system science, analysis of social network and searching in Internet. In order to improve effi- ciency and effectiveness of finding important node, a new algorithm based on shortest-path betweenness and closeness centrality is presented. It ensures important nodes in the whole network by using the shortest-path betweenness, analyses the importance of important nodes by using the closeness centrality. Compared with the current approach, the results obtained from performance analysis show the algorithm is a feasible and efficient approach for finding important nodes in large-scale P2P networks.

关 键 词：重要节点 最短路径介数 中心接近度 复杂网络 网络拓扑 

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