發(fā)布時間：2018-11-07 10:28

【摘要】：連接多個不同社團(tuán)的節(jié)點(diǎn)稱為結(jié)構(gòu)洞節(jié)點(diǎn),部分已有的結(jié)構(gòu)洞節(jié)點(diǎn)檢測方法雖然可以檢測到關(guān)鍵節(jié)點(diǎn),但存在一些不足:基于局部的測量方法忽略了網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu);對于大規(guī)模復(fù)雜的網(wǎng)絡(luò)來說,基于全局的測量方法可擴(kuò)展性差,等等。為了高效準(zhǔn)確地檢測社會網(wǎng)絡(luò)中具有影響力的節(jié)點(diǎn),提出了一種新的結(jié)構(gòu)洞度量方法 E-Burt,用來尋找結(jié)構(gòu)洞節(jié)點(diǎn)。該方法利用節(jié)點(diǎn)與其二步鄰居構(gòu)成的拓?fù)潢P(guān)系來計(jì)算節(jié)點(diǎn)的有效規(guī)模,用該結(jié)果作為結(jié)構(gòu)洞節(jié)點(diǎn)重要性的評價指標(biāo),計(jì)算每個節(jié)點(diǎn)的結(jié)構(gòu)洞度量值,并給出了形式化定義。E-B算法基于網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu),每次模擬迭代將選中的結(jié)構(gòu)洞節(jié)點(diǎn)度量值置為零,下一次迭代只計(jì)算該節(jié)點(diǎn)二步鄰居的有效規(guī)模,大大降低了時間復(fù)雜度。最后通過實(shí)驗(yàn)驗(yàn)證了算法的時間效率,分析了算法的精確度,對算法的正確性進(jìn)行了證明,并與存在的經(jīng)典結(jié)構(gòu)洞發(fā)現(xiàn)算法進(jìn)行了對比。
[Abstract]:Nodes connected with different communities are called structural hole nodes. Some of the existing structural hole node detection methods can detect key nodes, but there are some shortcomings: the local measurement method ignores the network topology; For large-scale and complex networks, global-based measurement methods have poor scalability, and so on. In order to efficiently and accurately detect the influential nodes in social networks, a new structural hole measurement method, E-Burt, is proposed to find structural holes. Based on the topological relation between nodes and their two-step neighbors, the effective scale of nodes is calculated. The result is used as the evaluation index of the importance of structural holes, and the structural hole weights of each node are calculated. The formal definition is given. E-B algorithm is based on the network topology. Each simulation iteration sets the selected structural hole node to zero, and the next iteration only calculates the effective scale of the two-step neighbor of the node. The time complexity is greatly reduced. Finally, the time efficiency of the algorithm is verified by experiments, the accuracy of the algorithm is analyzed, the correctness of the algorithm is proved, and the existence of the classical structure hole discovery algorithm is compared.
【作者單位】： 黑龍江大學(xué)計(jì)算機(jī)科學(xué)技術(shù)學(xué)院;黑龍江大學(xué)數(shù)據(jù)庫與并行計(jì)算重點(diǎn)實(shí)驗(yàn)室;
【基金】：黑龍江大學(xué)研究生創(chuàng)新科研項(xiàng)目重點(diǎn)項(xiàng)目(YJSCX2016-018HLJU)
【分類號】：O157.5

【相似文獻(xiàn)】

相關(guān)期刊論文 前4條

1 廖麗平;胡仁杰;張光宇;;模糊社會網(wǎng)絡(luò)的結(jié)構(gòu)洞分析方法[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年04期

2 鄧世果;吳干華;楊會杰;;基于基尼系數(shù)的網(wǎng)絡(luò)結(jié)構(gòu)洞測量[J];上海理工大學(xué)學(xué)報(bào);2011年05期

3 施宏偉;郭君;;基于結(jié)構(gòu)洞約束的跨企業(yè)融知與融知路徑選擇模型[J];軟科學(xué);2013年01期

4 汪丹;;結(jié)構(gòu)洞算法的比較與測評[J];現(xiàn)代情報(bào);2008年09期

，

本文編號：2316070