计算机科学 ›› 2017, Vol. 44 ›› Issue (4): 188-192.doi: 10.11896/j.issn.1002-137X.2017.04.041

• 高性能计算 • 上一篇    下一篇

大规模数据下的社交网络结构洞节点发现算法研究

王珍,韩忠明,李晋   

  1. 电子工程学院网络系 合肥230037,北京工商大学计算机与信息工程学院 北京100048,北京信息科技大学 北京100101
  • 出版日期:2018-11-13 发布日期:2018-11-13
  • 基金资助:
    本文受国家自然科学基金项目(61170112),北京市教委科研计划项目(SM201411232005)资助

Research on Social Network Structural Holes Discovery Algorithm under Large-scale Data

WANG Zhen, HAN Zhong-ming and LI Jin   

  • Online:2018-11-13 Published:2018-11-13

摘要: 随着社会网络数据规模的递增,结构洞节点计算涉及的计算量呈几何级增长,如何构建有效的并行化算法并缩短算法运行的时间成为当前研究的难点。针对大规模数据量下结构洞节点发现算法的不足,利用并行化思想设计实现了基于MapReduce的结构洞节点发现算法。该算法通过DBLP,YouTube和Califonia公路网这3组规模不同的数据集在Hadoop集群上运行的实验结果表明,增加DataNode机器节点的数量能够缩短算法运行的时间,提高运行效率且具有良好的并行加速比和扩展性能。

关键词: 并行计算,社会网络,结构洞,节点发现

Abstract: With the increase of social network data scale,the amount of calculation on structural holes exponentially increases.How to construct efficient parallel algorithms to shorten the running time of algorithms becomes the difficulties of the current study.This paper concentrated on shortages of network structural holes discovery algorithm,using parallel thought to design structural holes discovery algorithm based on MapReduce.The algorithm uses three groups of different sizes of data sets which are DBLP,YouTube and California road network to test on Hadoop.The results show that increasing the number of Data Node’s machine nodes can shorten the running time of algorithms and increase ope-rational efficiency,and this algorithm has good parallel speedup and scalability.

Key words: Parallel computing,Social networks,Structural holes,Node discovery

[1] YUAN W G,LIU Y,CHENG J J,et al.Empirical analysis ofmicroblog centrality and spread influence based on Bi-directional connection[J].Acta Physica Sinica,2013,62(3):494-503.(in Chinese) 苑卫国,刘云,程军军,等.微博双向 “关注” 网络节点中心性及传播影响力的分析 [J].物理学报,2013,62(3):494-503.
[2] LUO Z G,DING F,JIANG X Z,et al.New Progress on Community Detection in Complex Networks[J].Journal of National University of Defense Technology,2011,33(1):47-52.(in Chinese) 骆志刚,丁凡,蒋晓舟,等.复杂网络社团发现算法研究新进展 [J].国防科技大学学报,2011,33(1):47-52.
[3] DI VINCENZO F,HEMPHL J,MAGNUSSON M,et al.Ex- ploring the role of structural holes in learning:an empirical studyof Swedish pharmacies[J].Journal of Knowledge Management,2012,16(4):576-591.
[4] XIA S,DAI B T,LIM E P,et al.Link prediction for bipartite social networks:the Role of Structural Holes[C]∥2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).IEEE,2012:153-157.
[5] SU X P,SONG Y R.Leveraging neighborhood “structural holes”to identifying key spreaders in so cial networks[J].Acta Physica Sinica,2015,4(2):1-11.(in Chinese) 苏晓萍,宋玉蓉.利用邻域“结构洞”寻找社会网络中最具影响力节点[J].物理学报,2015,64(2):1-11.
[6] YANG J Z.Research on the Identifying Nodes in Online Social Network[D].Taiyuan:Taiyuan University of Technology,2014.(in Chinese) 杨敬宗.在线社会网络影响力节点发现方法研究[D].太原:太原理工大学,2014.
[7] WANG L,CHENG S Q,SHEN H W,et al.Structure Inference and Prediction in the Co-Evolution of Social Networks[J].Journal of Computer Research and Development,2015,0(12):2492-2503.(in Chinese) 王莉,程苏琦,沈华伟,等.在线社会网络共演化的结构推断与预测[J].计算机研究与发展,2015,50(12):2492-2503.
[8] BURT R S,KILDUFF M,TASSELLI S.Social Network Analysis:Foundations and Frontiers on Advantage[J].Annual Review of Psychology,2013,64(2):527-547.
[9] YAN H L,XIANG J U,ZHANG X Y,et al.Community detection using global and local structural information[J].Pramana,2013,80(1):173-185.
[10] HAN Z M,WU Y,TAN X S,et al.Comparison and analysis on measure indexes for structural hole nodes in social network[J].Journal of Shandong University (Engineering Science),2015,1(1):1-8.(in Chinese) 韩忠明,吴杨,谭旭升,等.社会网络结构洞节点度量指标比较与分析[J].山东大学学报(工学版),2015,1(1):1-8.
[11] SHI Q,XIAO Y H,WEN W H,et al.Research on method for extracting large-scale social network based on Mapreduce[J].Application Research of Computers,2011,1(1):145-148.(in Chinese) 施佺,肖仰华,温文灏,等.基于Mapreduce的大规模社会网络提取方法研究[J].计算机应用研究,2011,1(1):145-148.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!