参考文献
[1] 乔秀全, 杨 春, 李晓峰, 等. 社交网络服务中一种基于用户上下文的信任度计算方法[J]. 计算机学报, 2011, 34(12): 2403-2413.
[2] 陈 琼, 李辉辉, 肖南峰. 基于节点动态属性相似性的社会网络社区推荐算法[J]. 计算机应用, 2010, 30(5): 1-5.
[3] Fortunato S. Community Detection in Graphs[J]. Physics Re- ports, 2010, 486(3): 75-174.
[4] Ahn Y Y, Bagrow J P, Lehmann S. Link Communities Reveal Multiscale Complexity in Networks[J]. Nature, 2010, 466(7307): 761-764
[5] Zhang Yuzhou, Wang Jianyong, Wang Yi, et al. Parallel Com- munity Detection on Large Networks with Propinquity Dynamics[C]//Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. [S. l.]: ACM Press, 2009: 997-1006.
[6] Sun Jimeng, Faloutsos C, Papadimitriou S, et al. Graphscope: Parameter-free Mining of Large Time-evolving Graphs[C]// Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. [S. l]: ACM Press, 2007: 687-696.
[7] Capocci A, Servedio V D P, Caldarelli G, et al. Detecting Communities in Large Networks[J]. Physica A: Statistical Mechanics and Its Applications, 2005, 352(2): 669-676.
[8] Hopcroft J, Khan O, Kulis B, et al. Tracking Evolving Com- munities in Large Linked Networks[J]. Proceedings of the National Academy of Sciences of the United States of America, 2012, 101(S1): 5249-5253.
[9] Tantipathananandh C, Berger-wolf T. Constant-factor Approxi- mation Algorithms for Identifying Dynamic Communities[C]// Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. [S. l.]: ACM Press, 2009: 827-836.
[10] Dinh T N, Xuan Ying, Thai M T. Towards Social-aware Routing in Dynamic Communication Networks[C]//Proc. of the 28th IEEE International on Performance Computing and Communications Conference. [S. l.]: IEEE Press, 2009: 161-168.
(下转第86页)
(上接第68页)
[11] Chen Duanbing, Fu Yan, Shang Mingsheng. A Fast and Efficient Heuristic Algorithm for Detecting Community Structures in Complex Networks[J]. Physica A: Statistical Mechanics and Its Applications, 2009, 388(13): 2741-2749.
[12] Newman M E J, Girvan M. Finding and Evaluating Community Structure in Networks[J]. Physical Review E, 2004, 69(2): 261-269.
[13] Blondel V D, Guillaume J L, Lambiotte R, et al. Fast Unfolding of Communities in Large Networks[J]. Journal of Statistical Mechanics: Theory and Experiment, 2008, 8(10): 1742-1754.
[14] Newman M E J. Fast Algorithm for Detecting Community Structure in Networks[J]. Physical Review E, 2004, 69(6): 66-73.
[15] Ye Zhenqing, Hu Songnian, Yu Jun. Adaptive Clustering Algorithm for Community Detection in Complex Networks[J]. Physical Review E, 2008, 78(4): 461-468.
[16] 马昱欣, 徐佳逸, 彭帝超, 等. 基于可视分析的多上下文移动社交网络社区发现[J]. 计算机科学与技术学报, 2013, 28(5): 797-809.
[17] Pan Hui, Crowcroft J. How Small Labels Create Big Improvements[C]//Proc. of the 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops. [S. l.]: IEEE Press, 2007: 65-70.
[18] Eagle N, Pentland A. Reality Mining: Sensing Complex Social Systems[J]. Personal and Ubiquitous Computing, 2011, 10(4): 255-268.
编辑 任吉慧 |