메뉴 건너뛰기




Volumn 6, Issue 6, 2014, Pages 426-439

Community detection in large-scale networks: A survey and empirical evaluation

Author keywords

Clustering; Community detection; Empirical evaluation; Graphs; Ground truth; Networks

Indexed keywords

DATA ANALYTICS; NETWORKS (CIRCUITS);

EID: 84927598115     PISSN: 19395108     EISSN: 19390068     Source Type: Journal    
DOI: 10.1002/wics.1319     Document Type: Review
Times cited : (223)

References (34)
  • 1
    • 33645830948 scopus 로고    scopus 로고
    • Cfinder: locating cliques and overlapping modules in biological networks
    • Adamcsek B, Palla G, Farkas IJ, Derényi I, Vicsek T. Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 2006, 22:1021-1023.
    • (2006) Bioinformatics , vol.22 , pp. 1021-1023
    • Adamcsek, B.1    Palla, G.2    Farkas, I.J.3    Derényi, I.4    Vicsek, T.5
  • 2
    • 84974676821 scopus 로고    scopus 로고
    • A graph based approach to extract a neighborhood customer community for collaborative filtering
    • eds. Berlin/Heidelberg: Springer
    • Reddy PK, Kitsuregawa M, Sreekanth P, Rao SS. A graph based approach to extract a neighborhood customer community for collaborative filtering. In: Subhash Bhalla, eds. Databases in Networked Information Systems. Berlin/Heidelberg: Springer; 2002, 188-200.
    • (2002) Databases in Networked Information Systems , pp. 188-200
    • Reddy, P.K.1    Kitsuregawa, M.2    Sreekanth, P.3    Rao, S.S.4
  • 3
    • 79961177418 scopus 로고    scopus 로고
    • Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science
    • Steinhaeuser K, Chawla NV, Ganguly AR. Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science. Stat Anal Data Mining 2011, 4:497-511.
    • (2011) Stat Anal Data Mining , vol.4 , pp. 497-511
    • Steinhaeuser, K.1    Chawla, N.V.2    Ganguly, A.R.3
  • 4
    • 84874279168 scopus 로고    scopus 로고
    • Community detection in graphs
    • abs/0906.0612
    • Fortunato S. Community detection in graphs. CoRR, abs/0906.0612, 2009.
    • (2009) CoRR
    • Fortunato, S.1
  • 5
    • 84893297272 scopus 로고    scopus 로고
    • A classification for community discovery methods in complex networks
    • abs/1206.3552
    • Coscia M, Giannotti F, Pedreschi D. A classification for community discovery methods in complex networks. CoRR, abs/1206.3552, 2012.
    • (2012) CoRR
    • Coscia, M.1    Giannotti, F.2    Pedreschi, D.3
  • 6
    • 84939281258 scopus 로고    scopus 로고
    • A unified community detection, visualization and analysis method
    • abs/1301.7006
    • Crampes M, Plantié M. A unified community detection, visualization and analysis method. CoRR, abs/1301.7006, 2013.
    • (2013) CoRR
    • Crampes, M.1    Plantié, M.2
  • 7
    • 84939281259 scopus 로고    scopus 로고
    • Clustering and community detection in directed networks: a survey
    • abs/1308.0971
    • Malliaros FD, Vazirgiannis M. Clustering and community detection in directed networks: a survey. CoRR, abs/1308.0971, 2013.
    • (2013) CoRR
    • Malliaros, F.D.1    Vazirgiannis, M.2
  • 9
    • 71849108522 scopus 로고    scopus 로고
    • Community detection algorithms: a comparative analysis
    • Lancichinetti A, Fortunato S. Community detection algorithms: a comparative analysis. Phys Rev E 2009, 80:056117.
    • (2009) Phys Rev E , vol.80 , pp. 056117
    • Lancichinetti, A.1    Fortunato, S.2
  • 10
    • 84866321659 scopus 로고    scopus 로고
    • Comparative evaluation of community detection algorithms: a topological approach
    • Orman GK, Labatut V, Cherifi H. Comparative evaluation of community detection algorithms: a topological approach. J Stat Mech Theor Exp 2012, 2012:P08001.
    • (2012) J Stat Mech Theor Exp , vol.2012 , pp. P08001
    • Orman, G.K.1    Labatut, V.2    Cherifi, H.3
  • 11
    • 84874287099 scopus 로고    scopus 로고
    • Overlapping community detection in networks: the state-of-the-art and comparative study
    • Xie J, Kelley S, Szymanski BK. Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv 2013, 45:43.
    • (2013) ACM Comput Surv , vol.45 , pp. 43
    • Xie, J.1    Kelley, S.2    Szymanski, B.K.3
  • 12
    • 84939281260 scopus 로고    scopus 로고
    • Empirical comparison of algorithms for network community detection
    • abs/1004.3539
    • Leskovec J, Lang KJ, Mahoney MW. Empirical comparison of algorithms for network community detection. CoRR, abs/1004.3539, 2010.
    • (2010) CoRR
    • Leskovec, J.1    Lang, K.J.2    Mahoney, M.W.3
  • 13
    • 84864350728 scopus 로고    scopus 로고
    • An evaluation of community detection algorithms on large-scale email traffic
    • SEA. Berlin/Heidelberg: Springer; ; 283-294.
    • Moradi F, Olovsson T, Tsigas P. An evaluation of community detection algorithms on large-scale email traffic. In: SEA. Berlin/Heidelberg: Springer; 2012; 283-294.
    • (2012)
    • Moradi, F.1    Olovsson, T.2    Tsigas, P.3
  • 14
    • 84861430469 scopus 로고    scopus 로고
    • Towards linear time overlapping community detection in social networks
    • PAKDD. Berlin/Heidelberg: Springer;, 25-36.
    • Xie J, Szymanski BK. Towards linear time overlapping community detection in social networks. In: PAKDD. Berlin/Heidelberg: Springer; 2012, 25-36.
    • (2012)
    • Xie, J.1    Szymanski, B.K.2
  • 15
    • 80052767847 scopus 로고    scopus 로고
    • Scalable discovery of best clusters on large graphs
    • Macropol K, Singh AK. Scalable discovery of best clusters on large graphs. Proc VLDB Endowment 2010, 3:693-702.
    • (2010) Proc VLDB Endowment , vol.3 , pp. 693-702
    • Macropol, K.1    Singh, A.K.2
  • 16
    • 84883369138 scopus 로고    scopus 로고
    • Efficient discovery of overlapping communities in massive networks
    • Gopalan PK, Blei DM. Efficient discovery of overlapping communities in massive networks. Proc Natl Acad Sci 2013, 110:14534-14539.
    • (2013) Proc Natl Acad Sci , vol.110 , pp. 14534-14539
    • Gopalan, P.K.1    Blei, D.M.2
  • 19
    • 84884973855 scopus 로고    scopus 로고
    • Mixing local and global information for community detection in large networks
    • De Meo P, Ferrara E, Fiumara G, Provetti A. Mixing local and global information for community detection in large networks. J Comput Syst Sci 2014, 80:72-87.
    • (2014) J Comput Syst Sci , vol.80 , pp. 72-87
    • De Meo, P.1    Ferrara, E.2    Fiumara, G.3    Provetti, A.4
  • 20
    • 84861732705 scopus 로고    scopus 로고
    • Dense subgraph extraction with application to community detection
    • Chen J, Saad Y. Dense subgraph extraction with application to community detection. IEEE Trans Knowl Data Eng 2012, 24:1216-1230.
    • (2012) IEEE Trans Knowl Data Eng , vol.24 , pp. 1216-1230
    • Chen, J.1    Saad, Y.2
  • 21
    • 77951967208 scopus 로고    scopus 로고
    • Spici: a fast clustering algorithm for large biological networks
    • Jiang P, Singh M. Spici: a fast clustering algorithm for large biological networks. Bioinformatics 2010, 26:1105-1111.
    • (2010) Bioinformatics , vol.26 , pp. 1105-1111
    • Jiang, P.1    Singh, M.2
  • 22
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • Clauset A, Newman MEJ, Moore C. Finding community structure in very large networks. Phys Rev E 2004, 70:066111.
    • (2004) Phys Rev E , vol.70 , pp. 066111
    • Clauset, A.1    Newman, M.E.J.2    Moore, C.3
  • 23
    • 34548856552 scopus 로고    scopus 로고
    • Near linear time algorithm to detect community structures in large-scale networks
    • Raghavan UN, Albert R, Kumara S. Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 2007, 76:036106.
    • (2007) Phys Rev E , vol.76 , pp. 036106
    • Raghavan, U.N.1    Albert, R.2    Kumara, S.3
  • 24
    • 33749468596 scopus 로고    scopus 로고
    • Finding community structure in networks using the eigenvectors of matrices
    • Newman MEJ. Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 2006, 74:036104.
    • (2006) Phys Rev E , vol.74 , pp. 036104
    • Newman, M.E.J.1
  • 26
    • 20444504323 scopus 로고    scopus 로고
    • Uncovering the overlapping community structure of complex networks in nature and society
    • Palla G, Derényi I, Farkas I, Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature 2005, 435:814-818.
    • (2005) Nature , vol.435 , pp. 814-818
    • Palla, G.1    Derényi, I.2    Farkas, I.3    Vicsek, T.4
  • 27
    • 33749379347 scopus 로고    scopus 로고
    • The worst-case time complexity for generating all maximal cliques
    • eds. Berlin/Heidelberg: Springer;
    • Tomita E, Tanaka A, Takahashi H. The worst-case time complexity for generating all maximal cliques. In Chwa KY, Munro JI, eds. Computing and Combinatorics. Berlin/Heidelberg: Springer; 2004, 161-170.
    • (2004) Computing and Combinatorics , pp. 161-170
    • Tomita, E.1    Tanaka, A.2    Takahashi, H.3    Chwa, K.Y.4    Munro, J.I.5
  • 30
    • 0042931335 scopus 로고    scopus 로고
    • Finding exact and approximate block structures for ilu preconditioning
    • Saad Y. Finding exact and approximate block structures for ilu preconditioning. SIAM J Sci Comput 2003, 24:1107-1123.
    • (2003) SIAM J Sci Comput , vol.24 , pp. 1107-1123
    • Saad, Y.1
  • 31
    • 33744805096 scopus 로고    scopus 로고
    • Development and implementation of an algorithm for detection of protein complexes in large interaction networks
    • Altaf-Ul-Amin M, Shinbo Y, Mihara K, Kurokawa K, Kanaya S. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics 2006, 7:207.
    • (2006) BMC Bioinformatics , vol.7 , pp. 207
    • Altaf-Ul-Amin, M.1    Shinbo, Y.2    Mihara, K.3    Kurokawa, K.4    Kanaya, S.5
  • 32
    • 84874081701 scopus 로고    scopus 로고
    • Defining and evaluating network communities based on ground-truth
    • ICDM. New York, NY: ACM;, 745-754.
    • Yang J, Leskovec J. Defining and evaluating network communities based on ground-truth. In: ICDM. New York, NY: ACM; 2012, 745-754.
    • (2012)
    • Yang, J.1    Leskovec, J.2
  • 34
    • 84881103597 scopus 로고    scopus 로고
    • Normalized mutual information to evaluate overlapping community finding algorithms
    • abs/1110.2515
    • McDaid AF, Greene D, Hurley NJ. Normalized mutual information to evaluate overlapping community finding algorithms. CoRR, abs/1110.2515, 2011.
    • (2011) CoRR
    • McDaid, A.F.1    Greene, D.2    Hurley, N.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.