-
1
-
-
33645830948
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
8
-
-
26244464025
-
Comparing community structure identification
-
Danon L, Diaz-Guilera A, Duch J, Arenas A. Comparing community structure identification. J Stat Mech Theor Exp 2005, 2005:P09008.
-
(2005)
J Stat Mech Theor Exp
, vol.2005
, pp. P09008
-
-
Danon, L.1
Diaz-Guilera, A.2
Duch, J.3
Arenas, A.4
-
9
-
-
71849108522
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
17
-
-
84867423946
-
-
Scalable multi-threaded community detection in social networks. : IEEE
-
Riedy J, Bader DA, Meyerhenke H. Scalable multi-threaded community detection in social networks. In: Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International. Washington, DC: IEEE; 2012, 1619-1628.
-
(2012)
Parallel and Distributed Processing Symposim Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International
, pp. 1619-1628
-
-
Riedy, J.1
Bader, D.A.2
Meyerhenke, H.3
Washington, D.C.4
-
18
-
-
84908412479
-
An ensemble learning strategy for graph clustering
-
eds. Providence, RI: American Mathematical Society
-
Ovelgönne M, Geyer-Schulz A. An ensemble learning strategy for graph clustering. In: Bader DA, Meyerhenke H, Sanders P, Wagner D, eds. Graph Partitioning and Graph Clustering. Providence, RI: American Mathematical Society; 2012, 187-206.
-
(2012)
Graph Partitioning and Graph Clustering
, pp. 187-206
-
-
Ovelgönne, M.1
Geyer-Schulz, A.2
Bader, D.A.3
Meyerhenke, H.4
Sanders, P.5
Wagner, D.6
-
19
-
-
84884973855
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
28
-
-
54249110594
-
Mixed membership stochastic blockmodels
-
Airoldi EM, Blei DM, Fienberg SE, Xing EP. Mixed membership stochastic blockmodels. J Mach Learn Res 2008, 9:1981-2014.
-
(2008)
J Mach Learn Res
, vol.9
, pp. 1981-2014
-
-
Airoldi, E.M.1
Blei, D.M.2
Fienberg, S.E.3
Xing, E.P.4
-
29
-
-
56349094785
-
Fast unfolding of communities in large networks
-
Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech Theor Exp 2008, 2008:P10008.
-
(2008)
J Stat Mech Theor Exp
, vol.2008
, pp. P10008
-
-
Blondel, V.D.1
Guillaume, J.-L.2
Lambiotte, R.3
Lefebvre, E.4
-
30
-
-
0042931335
-
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
-
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
-
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
-
33
-
-
85040362304
-
-
eds. Chapman and Hall/CRC: CRC Press
-
Samatova NF, Hendrix W, Jenkins J, Padmanabhan K, Chakraborty A. In: Samatova NF, Hendrix W, Jenkins J, Padmanabhan K, Chakraborty A, eds. Practical Graph Mining with R. Chapman and Hall/CRC: CRC Press; 2013.
-
(2013)
Practical Graph Mining with R
-
-
Samatova, N.F.1
Hendrix, W.2
Jenkins, J.3
Padmanabhan, K.4
Chakraborty, A.5
Samatova, N.F.6
Hendrix, W.7
Jenkins, J.8
Padmanabhan, K.9
Chakraborty, A.10
-
34
-
-
84881103597
-
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
|