期刊文献+

基于影响簇选择模型和MCMC采样的社交圈子识别算法 被引量:1

An automatic detection algorithm for social circles based on influential cluster selection model and MCMC sampler
原文传递
导出
摘要 提出一种新的紧密度公式和一种影响簇发现模型,并在此基础上设计基于局部社团探测的采样算法MCMCS_LCD,以及基于MCMCS_LCD的社交圈子自动识别算法SCD_MCMCS_LCD,算法综合考虑局部模块度和节点间紧密度.在真实数据集上的实验表明,SCD_MCMCS_LCD算法在具有较快收敛速度的同时还具有较好的社交圈子识别效果. This paper proposes a new expression of the close affinities and the influential cluster selec -tion model, and on this basis to design an efficient sampler algorithm , called MCMCS_LCD, and fur-ther design an automatic detection method called SCD_MCMCS_LCD.The algorithm takes account in-to both local modularity M and close affinities .Experiments demonstrate that SCD_MCMCS_LCD has a faster convergence speed while still maintains a good social circle recognition effect .
出处 《福州大学学报(自然科学版)》 CAS 北大核心 2015年第5期604-611,共8页 Journal of Fuzhou University(Natural Science Edition)
基金 国家自然科学基金资助项目(61300104) 福建省自然科学基金资助项目(2013J01230)
关键词 社交网络 社交圈子识别 马尔科夫蒙特卡洛采样 局部社团探测 social network social circles discovering MCMC sampler local community detection
  • 相关文献

参考文献16

  • 1曹怀虎,朱建明,潘耘,李海峰.情景感知的P2P移动社交网络构造及发现算法[J].计算机学报,2012,35(6):1223-1234. 被引量:24
  • 2朱牧,孟凡荣,周勇.基于链接密度聚类的重叠社区发现算法[J].计算机研究与发展,2013,50(12):2520-2530. 被引量:34
  • 3Palla G, Derenyi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society [J]. Nature, 2005, 435(7043): 814-818.
  • 4Evans T S. Clique graphs and overlapping communities [ J]. Journal of Statistical Mechanics Theory and Experiment, 2010, 34 (3) : 257 - 265.
  • 5Shen Huawei, Cheng Xueqi, Cai Kai, et al. Detect overlapping and hierarchical community structure in networks [ J]. Physica A: Statistical Mechanics and its Applications, 2009, 388(8) : 1 706 -1 712.
  • 6Blondel V D, Guillaume J L, Lambiotte R, et al. Fast unfolding of communities in large networks [ J ]. Journal of Statistical Me- chanics: Theory and Experiment, 2008, 30(2) : 155 -168.
  • 7Lancichinetti A, Fortunato S, Kertrsz J. Detecting the overlapping and hierarchical community structure in complex networks [J]. New Journal of Physics, 2009, 625(15) : 19 -44.
  • 8Lee C, Reid F, Mcdaid A, et al. Detecting highly overlapping community structure by greedy clique expansion[ C ]// Proc of the 4th International Workshop on Social Network Mining and Analysis. Washington D C: ACM, 2010:33 -42.
  • 9Gregory S. Finding overlapping communities in networks by label propagation [ J ]. New Journal of Physics, 2010, 12 (10) : 2 011 - 2 024.
  • 10武志昊,林友芳,Steve Gregory,万怀宇,田盛丰.Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks[J].Journal of Computer Science & Technology,2012,27(3):468-479. 被引量:41

二级参考文献101

  • 1杨楠,弓丹志,李忺,孟小峰.Web社区发现技术综述[J].计算机研究与发展,2005,42(3):439-447. 被引量:35
  • 2任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法[J].软件学报,2006,17(3):422-433. 被引量:156
  • 3Getoor L, Diehl C P. Link mining: A survey [J]. SIGKDD Explorations, 2005, 7(2): 3-12.
  • 4Girvan M, Newman M E J. Community structure in social and biological networks [J]. Proc of the National Academy of Sciences, 2002, 99(12): 7821-7826.
  • 5Han Jiawei. Data Mining= Concepts and Techniques [M]. Kamber M. 2nd ed. Beijing: China Machine Press, 2006.
  • 6Newman M E J. Detecting community structure in networks [J]. The European Physical Journal B Condensed Matter and Complex Systems, 2004, 38(2): 321-3:30.
  • 7Newman M E J. Fast algorithm for detecting community structure in networks[J]. Physical ReviewE, 2004, 69(6): 066133.
  • 8Brandes U. faster algorithm for betweenness centrality [J]. Journal of Mathematical Sociology, 2001, 25:163-177.
  • 9Clauset A, Newman M E J, Moore C. Finding community structure in very large networks [J]. Physical Review E, 2004, 70(6): 066111.
  • 10Blondel V D, Guillaume J, Lambiotte R, et al. Fast unfolding of communities in large networks [J].Journal of Statistical Mechanics: Theory and Experiment, 2008 (10) : 1742-5468.

共引文献160

同被引文献9

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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