[1] Strogatz S H.Exploring complex networks[J].Nature,2001,410(6825):268-276.
[2] Boccaletti S,Ivanchenko M,Latora V,et al.Detecting complex network modularity by dynamical clustering[J].Physical Review E,2007,75(4):45102.
[3] Newman M E,Girvan M.Finding and evaluating community structure in networks[J].Physical Review E,2004,69(2):26113.
[4] Newman M E.Fast algorithm for detecting community structure in networks[J].Physical Review E,2004,69(6):66133.
[5] Blondel V D,Guillaume J,Lambiotte R,et al.Fast unfolding of communities in large networks[J].Journal of Statistical Mechanics:Theory and Experiment,2008,no.10:P10008.
[6] 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):36106.
[7] Jeong H,Tombor B,Albert R,et al.The large-scale organization of metabolic networks[J].Nature,2000,407(6804):651-654.
[8] 崔颖安,李雪,王志晓,张德运.社会化媒体大数据多阶段整群抽样方法[J].软件学报,2014,(4):781-796. Cui Ying-An,Li Xue,Wang Zhi-Xiao,Zhang De-Yun.Sampling online social media big data based multi stage cluster method[J].Journal of Software,2014,(4):781-796.(in Chinese)
[9] 张新猛,蒋盛益.基于核心图增量聚类的复杂网络划分算法[J].自动化学报,2013,39(7):1117-1125. Zhang Xin-meng,Jiang Sheng-yi.Complex network community detection based on core graph incremental clustering[J].Acta Automatica Sinica,2013,39(7):1117-1125.(in Chinese)
[10] Hübler C,Kriegel H,Borgwardt K,et al.Metropolis algorithms for representative subgraph sampling[A].Eighth IEEE International Conference on Data Mining[C],Pisa,Italy:IEEE,2008.
[11] Hastings W K.Monte Carlo sampling methods using Markov chains and their applications[J].Biometrika,1970,57(1),97-109.
[12] Salehi M,Rabiee H R,Rajabi A.Sampling from complex networks with high community structures[J].Chaos:An Interdisciplinary Journal of Nonlinear Science,2012,22(2):023126.
[13] Ahmed N K,Neville J,Kompella R.Network sampling:from static to streaming graphs[J].ACM Transactions on Knowledge Discovery from Data (TKDD),2014,8(2):7.
[14] Leskovec J,Faloutsos C.Sampling from large graphs[A].Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].Philadelphia,USA:ACM,2006.
[15] Lovász L.Random walks on graphs[J].Combinatorics,PaulErdos is Eighty,1993,2(1-46):4.
[16] Fortunato S,Hric D.Community detection in networks:a user guide[J].Physics Reports,2016,659:1-44.
[17] Maiya A S,Berger-Wolf T Y.Sampling community structure[A].Proceedings of the 19th International Conference on World Wide Web[C].NC,USA:ACM,2010.
[18] Mall R,Langone R,Suykens J A.FURS:fast and unique representative subset selection retaining large-scale community structure[J].Social Network Analysis and Mining,2013,3(4):1075-1095.
[19] Khorasgani R R,Chen J,Zaiane O R.Top leaders community detection approach in information networks[A].4th SNA-KDD Workshop on Social Network Mining and Analysis[C].Washington DC,USA:ACM,2010.
[20] Yang J,Leskovec J.Overlapping community detection at scale:a nonnegative matrix factorization approach[A].Proceedings of the 6th ACM International Conference on Web Search and Data Mining[C].Rome,Italy:ACM,2013.
[21] Benson,A.R.,Gleich,D.F.,& Leskovec,J.Higher-order organization of complex networks[J].Science,2016,353(6295),163-166.
[22] Lancichinetti A,Fortunato S,Radicchi F.Benchmark graphs for testing community detection algorithms[J].Physical Review E,2008,78(4):046110. |