一種改進的基于信息傳播率的復(fù)雜網(wǎng)絡(luò)影響力評估算法
發(fā)布時間：2018-10-17 11:18
【摘要】：評價網(wǎng)絡(luò)中節(jié)點的信息傳播影響力對于理解網(wǎng)絡(luò)結(jié)構(gòu)與網(wǎng)絡(luò)功能具有重要意義.目前,許多基于最短路徑的指標,如接近中心性、介數(shù)中心性以及半局部(SP)指標等相繼用于評價節(jié)點傳播影響力.最短路徑表示節(jié)點間信息傳播途徑始終選擇最優(yōu)方式,然而實際上網(wǎng)絡(luò)間的信息傳播過程更類似于隨機游走,信息的傳播途徑可以是節(jié)點間的任一可達路徑,在集聚系數(shù)高的網(wǎng)絡(luò)中,節(jié)點的局部高聚簇性有利于信息的有效擴散,若只考慮信息按最優(yōu)傳播方式即最短路徑傳播,則會低估節(jié)點信息傳播的能力,從而降低節(jié)點影響力的排序精度.綜合考慮節(jié)點與三步內(nèi)鄰居間的有效可達路徑以及信息傳播率,提出了一種SP指標的改進算法,即ASP算法.在多個經(jīng)典的實際網(wǎng)絡(luò)和人工網(wǎng)絡(luò)上利用SIR模型對傳播過程進行仿真,結(jié)果表明ASP指標與度指標、核數(shù)指標、接近中心性指標、介數(shù)中心性指標以及SP指標相比,可以更精確地對節(jié)點傳播影響力進行排序.
[Abstract]:It is very important to evaluate the influence of the nodes in the network to understand the network structure and network function. At present, many indicators based on the shortest path, such as near-centrality, intermediate-centrality and semi-local (SP), are used to evaluate the influence of node propagation. The shortest path means that the best way to spread information between nodes is always chosen. However, in fact, the process of information transmission between networks is more similar to random walk, and the path of information transmission can be any reachable path between nodes. In the network with high agglomeration coefficient, the local high clustering of nodes is conducive to the effective diffusion of information. If the information is propagated according to the optimal mode of transmission, that is, the shortest path, the ability of the node to spread information will be underestimated. In order to reduce the ranking accuracy of node influence. Considering the effective reachable path between nodes and three-step neighbors and the information propagation rate, an improved SP index algorithm, ASP algorithm, is proposed. The SIR model is used to simulate the propagation process in several classical networks and artificial networks. The results show that the ASP index is compared with the degree index, the kernel index, the close centrality index, the intermediate central index and the SP index. Node propagation influence can be sorted more accurately.
【作者單位】： 國防科技大學(xué)信息系統(tǒng)工程重點實驗室;國防大學(xué)聯(lián)合勤務(wù)學(xué)院;
【基金】：國家自然科學(xué)基金(批準號:61302144,61603408)資助的課題~~
【分類號】：O157.5
[Abstract]:It is very important to evaluate the influence of the nodes in the network to understand the network structure and network function. At present, many indicators based on the shortest path, such as near-centrality, intermediate-centrality and semi-local (SP), are used to evaluate the influence of node propagation. The shortest path means that the best way to spread information between nodes is always chosen. However, in fact, the process of information transmission between networks is more similar to random walk, and the path of information transmission can be any reachable path between nodes. In the network with high agglomeration coefficient, the local high clustering of nodes is conducive to the effective diffusion of information. If the information is propagated according to the optimal mode of transmission, that is, the shortest path, the ability of the node to spread information will be underestimated. In order to reduce the ranking accuracy of node influence. Considering the effective reachable path between nodes and three-step neighbors and the information propagation rate, an improved SP index algorithm, ASP algorithm, is proposed. The SIR model is used to simulate the propagation process in several classical networks and artificial networks. The results show that the ASP index is compared with the degree index, the kernel index, the close centrality index, the intermediate central index and the SP index. Node propagation influence can be sorted more accurately.
【作者單位】： 國防科技大學(xué)信息系統(tǒng)工程重點實驗室;國防大學(xué)聯(lián)合勤務(wù)學(xué)院;
【基金】：國家自然科學(xué)基金(批準號:61302144,61603408)資助的課題~~
【分類號】：O157.5
【相似文獻】
相關(guān)期刊論文 前1條
1 占望鵬;鄒W氄，
本文編號：2276485
本文鏈接：http://sikaile.net/kejilunwen/yysx/2276485.html
最近更新
教材專著
