期刊文献+

基于GN算法的微博社区识别方法 被引量:5

Identify communities in the microblogging based on the GN algorithm
下载PDF
导出
摘要 近年来,社交网络用户数量剧增,关于社交网络上的社区发现成为一种新的需要解决的问题。这里获取微博上的用户以及用户之间的关系作为研究样本,基于微博用户以及用户之间的关系,构建网络社区模型,在此基础上,利用GN算法对微博用户进行社区划分;为了提高算法的运行速度,采用模块度增量,在得出近似结果时就停止,减少运行时间。并在获取的数据上加以验证,GN算法适合用于社交网络中的社区发现,引入模块度增量有助于提高算法的速度。 Recently, the increasing number of social network users makes the community finding on the social network become a new problem. By obtaining the users' ID lists on the microblogging and taking the relationship between the users as the study sample, a network model using GN algorithm to identify the communities based on the relationship between the users was built. In order to im- prove the running speed, the algorithm uses the increment of the modularity, and stop running when the approximate results are obtained. Experiment results show that GN algorithm is suitable for the community detection on the social network and the increment of the modularity can improve the speed.
作者 徐杨 蒙祖强
出处 《广西大学学报(自然科学版)》 CAS 北大核心 2013年第6期1413-1417,共5页 Journal of Guangxi University(Natural Science Edition)
基金 国家自然科学基金资助项目(61063032 61363027) 广西自然科学基金资助项目(2012GXNSFAA053225)
关键词 社交网络 GN算法 社区发现 social network GN algorithm community detection
  • 相关文献

参考文献13

  • 1NEWMAN M E J. Communities,modules and large-scale structure in networks[J].{H}Nature Physics,2012,(01):25-31.
  • 2朱小虎,宋文军,王崇骏,谢俊元.用于社团发现的Girvan-Newman改进算法[J].计算机科学与探索,2010,4(12):1101-1108. 被引量:11
  • 3KERNIGHAN B W,LIN S. An efficient heuristic procedure for partitioning graphs[J].{H}Bell System Technical Journal,1970.291-307.
  • 4FIEDLER M. Algerbraic connectivity of graphs[J].Czech Math,1973,(98):298.
  • 5POTHEN A,SIMON H,LIOU K P. Partitioning sparse matrices with eigenvectors of graphs[J].{H}SIAM Journal on Matrix Analysis and Applications,1990,(03):430-452.
  • 6NEWMAN M E J. Fast algorithm for detecting community structure in networks[J].{H}Physical Review E,2004,(06):41-53.
  • 7CLAUSET A,NEWMAN M E J,MOORE C. Finding community structure in very large networks[J].{H}Physical Review E,2004,(06):135-142.
  • 8汪小帆;李翔;陈关荣.复杂网络理论及其应用[M]{H}北京:清华大学出版社,2006171-175.
  • 9GREGORY S. An algorithm to find overlapping community structure in networks[A].Berlin,Germany:Springer Berlin Heidelberg,2007.91-102.
  • 10丁荩,涂浩.微博感知突发重大新闻事件的研究与分析[J].广西大学学报(自然科学版),2011,36(A01):335-338. 被引量:6

二级参考文献28

共引文献107

同被引文献49

  • 1韩忠明,许峰敏,段大高.面向微博的概率图水军识别模型[J].计算机研究与发展,2013,50(S2):180-186. 被引量:10
  • 2张宇镭,党琰,贺平安.利用Pearson相关系数定量分析生物亲缘关系[J].计算机工程与应用,2005,41(33):79-82. 被引量:98
  • 3DANIEL A. Data management in the cloud: limitations and opportunities [ J ]. Bulletin of the IEEE Computer society Technical Committee on Data Engineering, 2009,32 ( 1 ) : 3 12.
  • 4BARROSO L, DEAN J, HOLZLE U. Web search for a planet: the google cluster architecture [ J ]. IEEE Micro, 2003, 23(2) :22-28.
  • 5周傲英.数据密集型计算一数据管理技术面临的挑战[J].中国计算机学会通讯,2009,5(7):50-60.
  • 6ABOUZEIDA P. Anarchitectural hybrid of MapReduce and DBMS technologies for anlytical workloads[ J]. VLDB,2009, 18(10) :922-933.
  • 7BLOOM B H. Space/time trade-offs in hash coding with allowable errors [ J]. Communications of the ACM, 1970,4 (6) : 422-426.
  • 8LI Fan, PEI Cao, ALMEIADA. Summary cache: A scalable wide-area Web cache sharing protocol[ J]. Communications of the ACM, 2008,8(10) :422-426.
  • 9AGUILERA J, GOLAB W, SHAH M. A practical scalable distributed B-Tree [J]. VLDB,2008,17 (5) : 356-364.
  • 10PAPADOPOIOS M, KATSAROS D. A-Tree: distributed indexing of multi-dimensional data for cloud computing environ- ments[ C ]//Proceedings of the 3rd IEEE International Conference on Cloud Computing Technology and Science. Athens, Greece, IEEE, 2011:407-414.

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部