CAJ | 학술논문

网络中重要节点的发现是研究网络特性的重要方面之一，在复杂网络、系统科学、社会网分析和互联网搜索等领域中具有广泛的应用价值。为提高全网范围内重要节点发现的效率和有效性，提出了一种基于最短路径介数及节点中心接近度的重要节点发现算法，通过最短路径介数的方法确定全网内的重要节点，利用中心接近度分析重要节点的重要性。测试结果表明，与同类的系统比较起来，该方法具有比较好的性能。
망락중중요절점적발현시연구망락특성적중요방면지일，재복잡망락、계통과학、사회망분석화호련망수색등영역중구유엄범적응용개치。위제고전망범위내중요절점발현적효솔화유효성，제출료일충기우최단로경개수급절점중심접근도적중요절점발현산법，통과최단로경개수적방법학정전망내적중요절점，이용중심접근도분석중요절점적중요성。측시결과표명，여동류적계통비교기래，해방법구유비교호적성능。
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.