摘要
作为网络结构分析的重要概念,结构洞占据者在获取网络有效信息方面起着关键的作用。目前,研究者们主要针对无权网络研究挖掘其结构洞的方法,然而,实际网络中,边权对网络性能的影响起着重要作用。以加权网络为研究对象,以约束度为衡量指标,提出一种加权的结构洞挖掘算法——W_HIS算法(Weighted HIS Algorithm)。将提出的W_HIS算法应用到公用数据和实例数据,与已有的算法进行对比,验证了算法的有效性。实验结果表明,提出的算法对挖掘结构洞占据者效果相对较好。
As an important concept of network structure analysis, structural hole spanners play a key role in terms of access to effective information of network. Currently, the researchers mainly study how to find structural hole spanners on the unweighted network. However, the weight of edge influences the performance of actual network. In this paper, a weighted algorithm, W_HIS algorithm（Weighted HIS algorithm）, with constraint as measurement for mining structural hole spanners is proposed for the weighted network. A public dataset and two real datasets are used to evaluate the proposed algorithm and the existing algorithm. The experimental results show that, the proposed algorithm in this paper is relatively well for mining structural hole spanners.
出处
《计算机工程与应用》
CSCD
北大核心
2016年第9期135-139,183,共6页
Computer Engineering and Applications
基金
国家自然科学基金(No.61175046)
安徽省高等学校省级自然科学研究项目(No.KJ2013A016)
安徽大学研究生学术创新研究项目
关键词
结构洞
加权网络
约束度
structural hole
weighted network
constraint
