[1] LIU D, JIN D, HE D, et al. Community mining in complex networks[J]. Journal of Computer Research and Development, 2013,50(10):2140-2154.(刘大有,金弟,何东晓,等.复杂网络社区挖掘综述[J].计算机研究与发展,2013,50(10):2140-2154.) [2] GIRVAN M, NEWMAN M E J. Community structure in social and biological networks[J]. Proceedings of the National Academy of Sciences, 2002,99(12):7821-7826. [3] LIN W, LU F, DING Z, et al. Parallel computing hierachical community approach based on weighted-graph[J]. Journal of Software, 2012,23(6):1517-1530.(林旺群,卢风顺,丁兆云,等.基于带权图的层次化社区并行计算方法[J].软件学报,2012,23(6):1517-1530.) [4] PALLA 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. [5] AHN Y Y, BAGROW J P, LEHMANN S. Link communities reveal multiscale complexity in networks[J]. Nature, 2010,466(7307):761-764. [6] ZHU M, MENG F, ZHOU Y. Density based link clustering algorithm for overlapping community detection[J]. Journal of Computer Research and Development, 2013,50(15):2520-2530.(朱牧,孟凡荣,周勇.基于链接密度聚类的重叠社区发现算法[J].计算机研究与发展,2013,50(15):2520-2530.) [7] LANCICHINETTI A, FORTUNATO S, KERTÉSZ J. Detecting the overlapping and hierarchical community structure in complex networks[J]. New Journal of Physics, 2009,11(3):1-18. [8] NGUYEN N P, DINH T N, NGUYEN D T, et al. Overlapping community structures and their detection on social networks[C]//Proceedings of the 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third International Conference on Social Computing (SocialCom). Piscataway: IEEE, 2011:35-40. [9] NEWMAN M E J, GIRVAN M. Finding and evaluating community structure in networks[J]. Physical Review E, 2004,69(2):1-15. [10] CLAUSET A, NEWMAN M E J, MOORE C. Finding community structure in very large networks[J]. Physical Review E, 2004,70(6):1-6. [11] YE Z, HU S, YU J. Adaptive clustering algorithm for community detection in complex networks[J]. Physical Review E, 2008,78(4):1242-1246.. [12] RAGHAVAN U N, ALBERT R, KUMARA S. Near linear time algorithm to detect community structures in large-scale networks[J]. Physical Review E, 2007,76(3):1-11. [13] XIE J, SZYMANSKI B K. LabelRank: a stabilized label propagation algorithm for community detection in networks[EB/OL].[2014-08-22]. http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=CD99138FA1F2D0F5A0232022E5AF328F?doi=10.1.1.299.8400&rep=rep1&type=pdf. [14] ROSVALL M, BERGSTROM C T. Maps of random walks on complex networks reveal community structure[J]. Proceedings of the National Academy of Sciences, 2008,105(4):1118-1123. [15] ZHU M, MENG F, ZHOU Y. Semisupervised clustering algorithm for networks based on fast affinity propagation[EB/OL].[2014-08-14]. http://www.hindawi.com/journals/mpe/2013/385265/. [16] XU X, YURUK N, FENG Z, et al. SCAN: a structural clustering algorithm for networks[C]//Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2007:824-833. [17] LANCICHINETTI A, FORTUNATO S, RADICCHI F. Benchmark graphs for testing community detection algorithms[EB/OL].[2014-08-14]. http://www.docin.com/p-97308760.html. [18] Newman. Network data[EB/OL].[2013-04-19]. http://www-personal.umich.edu/-~mejn/netdata/. |