Clustering and community detection in directed networks: A survey

Physics Reports

Volumn 533, Issue 4, 2013, Pages 95-142

  Malliaros, Fragkiskos D ^a   Vazirgiannis, Michalis ^a,b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Community detection; Complex networks; Directed networks; Graph clustering; Graph mining

Indexed keywords

EID: 84888062097     PISSN: 03701573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physrep.2013.08.002     Document Type: Review

References (158)

1. Newman M.E.J. The structure and function of complex networks. SIAM Rev. 2003, 45:167-256.
2. Erdös P., Rényi A. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 1960, 5:17-61.
3. Barabasi A.L., Albert R. Emergence of scaling in random networks. Science 1999, 286(5439):509-512.
4. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM'99, 1999, pp. 251-262.
5. Milgram S. The small-world problem. Psychol. Today 1967, 1(1):61-67.
6. Albert R., Jeong H., Barabasi A.-L. The diameter of the world wide web. Nature 1999, 401:130-131.
7. J. Leskovec, E. Horvitz, Planetary-scale views on a large instant-messaging network, in: Proceeding of the 17th International Conference on World Wide Web, WWW'08, 2008, pp. 915-924.
8. Girvan M., Newman M.E. Community structure in social and biological networks. Proc. Natl. Acad. Sci. 2002, 99(12):7821-7826.
9. Jain A.K., Murty M.N., Flynn P.J. Data clustering: a review. ACM Comput. Surv. 1999, 31(3):264-323.
10. Aggarwal C.C., Wang H. A Survey of Clustering Algorithms for Graph Data. Chapter in Managing and Mining Graph Data 2010, Springer Science+Business Media. C.C. Aggarwal, H. Wang (Eds.).
11. Fortunato S. Community detection in graphs. Phys. Rep. 2010, 486(3-5):75-174.
12. Popa O., Hazkani-Covo E., Landan G., Martin W., Dagan T. Directed networks reveal genomic barriers and dna repair bypasses to lateral gene transfer among prokaryotes. Genome Res. 2011, 21(4):599-609.
13. Deco G., Corbetta M. The dynamical balance of the brain at rest. The Neuroscientist 2011, 17(1):107-123.
14. Luxburg U. A tutorial on spectral clustering. Stat. Comput. 2007, 17(4):395-416.
15. M. Chen, J. Liu, X. Tang, Clustering via random walk hitting time on directed graphs, in: Proceedings of the 23rd National Conference on Artificial Intelligence, vol. 2, AAAI'08, 2008, pp. 616-621.
16. Foster J.G., Foster D.V., Grassberger P., Paczuski M. Edge direction and the structure of networks. Proc. Natl. Acad. Sci. 2010, 107(24):10815-10820.
17. Chung F. Laplacians and the cheeger inequality for directed graphs. Ann. Comb. 2005, 9:1-19.
18. Rosvall M., Bergstrom C.T. Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 2008, 105(4):1118-1123.
19. Schaeffer S.E. Graph clustering. Comput. Sci. Rev. 2007, 1(1):27-64.
20. Porter M.A., Onnela J.-P., Mucha P.J. Communities in networks. Notices Amer. Math. Soc 2009, 56(9):1082-1097.
21. Danon L., Duch J., Arenas A., Díaz-guilera A. Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005, 9008:09008.
22. Danon L., Duch J., Arenas A., Díaz-Guilera A. Community Structure Identification. Chapter in Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science 2007, World Scientific.
23. Coscia M., Giannotti F., Pedreschi D. A classification for community discovery methods in complex networks. Stat. Anal. Data Min. 2011, 4(5):512-546.
24. Parthasarathy S., Ruan Y., Satuluri V. Community Discovery in Social Networks: Applications, Methods and Emerging Trends. Chapter in Social Network Data Analytics 2011, Springer Science+Business Media. C.C. Aggarwal (Ed.).
25. Papadopoulos S., Kompatsiaris Y., Vakali A., Spyridonos P. Community detection in social media - performance and application considerations. Data Min. Knowl. Discov. 2012, 24(3):515-554.
26. Boccaletti S., Latora V., Moreno Y., Chavez M., Hwang D.-U. Complex networks: structure and dynamics. Phys. Rep. 2006, 424(4-5):175-308.
27. Chakrabarti D., Faloutsos C. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 2006, 38(1):1-69.
28. Golub G.H., Loan C.F.V. Matrix Computations 1996, The Johns Hopkins University Press. third ed.
29. Strang G. Linear Algebra and its Applications 1988, Brooks Cole. third ed.
30. Mieghem P.V. Graph Spectra for Complex Networks 2011, Cambridge University Press, New York, NY, USA.
31. Chung F.R.K. Spectral Graph Theory 1997, American Mathematical Society.
32. Y. Li, Z.-L. Zhang, Random walks on digraphs, the generalized digraph laplacian and the degree of asymmetry, in: Proceedings of the 7th International Workshop on Algorithms and Models for the Web Graph, WAW'10, 2010, pp. 74-85.
33. Li Y., Zhang Z.-L. Digraph Laplacian and the degree of asymmetry. Internet Mathematics 2012, 8(4):381-401.
34. Sinclair A. Improved bounds for mixing rates of markov chains and multicommodity flow. Combin. Probab. Comput. 1992, 1:351-370.
35. L. Page, S. Brin, R. Motwani, T. Winograd, The pagerank citation ranking: bringing order to the web, in: Proceedings of the 7th International World Wide Web Conference, WWW'98, 1998, pp. 161-172.
36. Pons P., Latapy M. Computing communities in large networks using random walks. J. Graph Algorithms Appl. 2006, 10(2):191-218.
37. Lovász L. Random walks on graphs: a survey. Combinatorics 1993, 2(1):1-46. Paul Erdos is Eighty.
38. Shi J., Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 2000, 22(8):888-905.
39. J. Leskovec, D. Huttenlocher, J. Kleinberg, Predicting positive and negative links in online social networks, in: Proceedings of the 19th International Conference on World Wide Web, WWW'10, 2010, pp. 641-650.
40. Newman M.E.J., Girvan M. Finding and evaluating community structure in networks. Phys. Rev. E 2004, 69(2):026113.
41. Newman M.E.J. Modularity and community structure in networks. Proc. Natl. Acad. Sci. 2006, 103(23):8577-8582.
42. Brandes U., Delling D., Gaertler M., Gorke R., Hoefer M., Nikoloski Z., Wagner D. On modularity clustering. IEEE Trans. Knowl. Data Eng. 2008, 20(2):172-188.
43. Newman M. Fast algorithm for detecting community structure in networks. Phys. Rev. E 2003, 69:066133+.
44. Clauset A., Newman M.E.J., Moore C. Finding community structure in very large networks. Phys. Rev. E 2004, 70(6):066111+.
45. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220(4598):671-680.
46. Guimera R., Sales-Pardo M., Amaral L. Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E 2004, 70(2):025101.
47. Guimera R., Amaral L.A.N. Functional cartography of complex metabolic networks. Nature 2005, 433(7028):895-900.
48. Duch J., Arenas A. Community detection in complex networks using extremal optimization. Phys. Rev. E 2005, 72:027104.
49. Fortunato S., Barthélemy M. Resolution limit in community detection. Proc. Natl. Acad. Sci. 2007, 104(1):36-41.
50. Leicht E.A., Newman M.E.J. Community structure in directed networks. Phys. Rev. Lett. 2008, 100:118703.
51. Šubelja L., Bajec M. Ubiquitousness of link-density and link-pattern communities in real-world networks. Eur. Phys. J. B 2012, 85(32):1-11.
52. B. Long, X. Xu, Z. Zhang, P.S. Yu, Community learning by graph approximation, in: Proceedings of the Seventh IEEE International Conference on Data Mining, ICDM'07, 2007, pp. 232-241.
53. Karypis G., Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 1998, 20(1):359-392.
54. V. Satuluri, S. Parthasarathy, Symmetrizations for clustering directed graphs, in: Proceedings of the 14th International Conference on Extending Database Technology, EDBT'11, 2011, pp. 343-354.
55. Kim Y., Son S.-W., Jeong H. Finding communities in directed networks. Phys. Rev. E 2010, 81:016103.
56. Lai D., Lu H., Nardini C. Finding communities in directed networks by pagerank random walk induced network embedding. Physica A 2010, 389:2443-2454.
57. D. Zhou, B. Schölkopf, T. Hofmann, Semi-supervised learning on directed graphs, in: Advances in Neural Information Processing Systems, NIPS'05, 2005, pp. 1633-1640.
58. Arenas A., Duch J., Fernández A., Gómez S. Size reduction of complex networks preserving modularity. New J. Phys. 2007, 9(6):176.
59. M. Meilǎ, W. Pentney, Clustering by weighted cuts in directed graphs, in: Proceedings of the 2007 SIAM International Conference on Data Mining, SDM'07, 2007, pp. 135-144.
60. Nascimento M.C.V., Carvalho A.C.P.L.F. Spectral methods for graph clustering - a survey. European J. Oper. Res. 2011, 211:221-231.
61. D. Zhou, J. Huang, B. Schölkopf, Learning from labeled and unlabeled data on a directed graph, in: Proceedings of the 22nd International Conference on Machine Learning, ICML'05, 2005, pp. 1036-1043.
62. Kleinberg J.M. Authoritative sources in a hyperlinked environment. J. ACM 1999, 46:604-632.
63. C. Gkantsidis, M. Mihail, E. Zegura, Spectral analysis of Internet topologies, in: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, INFOCOM'03, vol. 1, 2003, pp. 364-374.
64. Lai D., Lu H., Nardini C. Extracting weights from edge directions to find communities in directed networks. J. Stat. Mech. Theory Exp. 2010, 2010(06):P06003.
65. R. Lempel, S. Moran, The stochastic approach for link-structure analysis (salsa) and the tkc effect (2000) 387-401.
66. Guimerà R., Pardo M.S., Nunes Amaral L.A. Module identification in bipartite and directed networks. Phys. Rev. E 2007, 76(3):036102+.
67. Zhan W., Zhang Z., Guan J., Zhou S. Evolutionary method for finding communities in bipartite networks. Phys. Rev. E 2011, 83(6):066120+.
68. Costa A., Hansen P. Comment on evolutionary method for finding communities in bipartite networks. Phys. Rev. E 2011, 84:058101.
69. Brin S., Page L. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 1998, 30(1-7):107-117.
70. Y.-T. Chang, D. Pantazis, R. Leahy, Statistically optimal modular partitioning of directed graphs, in: 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers, ASILOMAR'10, 2010, pp. 1075-1079.
71. Y.-T. Chang, D. Pantazis, R. Leahy, Partitioning directed graphs based on modularity and information flow, in: 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI'11, 2011, pp. 1105-1108.
72. Y.-T. Chang, D. Pantazis, H. Hui, R. Leahy, Statistically optimal graph partition method based on modularity, in: 2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI'10, 2010, pp. 1193-1196.
73. Nicosia V., Mangioni G., Carchiolo V., Malgeri M. Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech. Theory Exp. 2009, 2009(03):P03024.
74. Muff S., Rao F., Caflisch A. Local modularity measure for network clusterizations. Phys. Rev. E 2005, 72(5):056107.
75. Gleich D. Hierarchical Directed Spectral Graph Partitioning, Tech. Rep 2006, Stanford University.
76. D. Zhou, C.J.C. Burges, Spectral clustering and transductive learning with multiple views, in: Proceedings of the 24th International Conference on Machine Learning, 2007, ICML'07, pp. 1159-1166.
77. S.X. Yu, J. Shi, Grouping with directed relationships, in: Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, EMMCVPR'01, 2001, pp. 283-297.
78. M. Mailǎ, J. Shi, A random walks view of spectral segmentation, in: Eighth International Workshop on Artificial Intelligence and Statistics, AISTATS'01, 2001.
79. Meila M., Xu L. Multiway Cuts and Spectral Clustering, Tech. Rep 2004, University of Washington.
80. W. Pentney, M. Meilǎ, Spectral clustering of biological sequence data, in: Proceedings of the 20th National Conference on Artificial Intelligence, vol.2, AAAI'05, 2005, pp. 845-850.
81. Capocci A., Servedio V.D.P., Caldarelli G., Colaiori F. Detecting communities in large networks. Phys. A: Stat. Theor. Phys. 2005, 352(2-4):669-676.
82. J. Huang, T. Zhu, D. Schuurmans, Web communities identification from random walks, in: Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases, PKDD'06, 2006, pp. 187-198.
83. K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S.K. Pham, E. Smirnova, Pagerank based clustering of hypertext document collections, in: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008, SIGIR'08, pp. 873-874.
84. T.H. Haveliwala, Topic-sensitive pagerank, in: Proceedings of the 11th International Conference on World Wide Web, WWW'02, 2002, pp. 517-526.
85. Lai D., Nardini C., Lu H. Partitioning networks into communities by message passing. Phys. Rev. E 2011, 83:016115.
86. Frey B.J., Dueck D. Clustering by passing messages between data points. Science 2007, 315:972-976.
87. R. Andersen, F. Chung, K. Lang, Local partitioning for directed graphs using pagerank, in: Proceedings of the 5th International Workshop on Algorithms and Models for the Web-graph, WAW'07, 2007, pp. 166-178.
88. Palla G., Farkas I.J., Pollner P., Derényi I., Vicsek T. Directed network modules. New J. Phys. 2007, 9(6):186.
89. S.E. Schaeffer, Stochastic local clustering for massive graphs, in: Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD'05, 2005, pp. 354-360.
90. S. Virtanen, Clustering the chilean web, in: Proceedings of the First Conference on Latin American Web Congress, LA-WEB'03, 2003, pp. 229-231.
91. Rosvall M., Bergstrom C.T. An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. 2008, 104(18):7327-7331.
92. Faloutsos C., Megalooikonomou V. On data mining, compression, and kolmogorov complexity. Data Min. Knowl. Discov. 2007, 15(1):3-20.
93. D. Chakrabarti, Autopart: parameter-free graph partitioning and outlier detection, in: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD'04, 2004, pp. 112-124.
94. Newman M.E., Leicht E.A. Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. 2007, 104(23):9564-9569.
95. Ramasco J.J., Mungan M. Inversion method for content-based networks. Phys. Rev. E 2008, 77(3):036122.
96. Wang J., Lai C.H. Detecting groups of similar components in complex networks. New J. Phys. 2008, 10(12):123023+.
97. Batagelj V. Notes on blockmodeling. Social Networks 1997, 19:143-155.
98. Batagelj V., Mrvar A. Pajek-analysis and visualization of large networks. Lecture Notes in Computer Science 2002, vol. 2265:8-11. Springer, Berlin/Heidelberg. P. Mutzel, M. Jnger, S. Leipert (Eds.).
99. Doreian P., Batagelj V., Ferligoj A. Generalized Blockmodeling 2005, Cambridge University Press.
100. Holland P., Laskey K.B., Leinhardt S. Stochastic blockmodels: some first steps. Social Networks 1983, 5:109-137.
101. Wang Y.J., Wong G.Y. Stochastic blockmodels for directed graphs. J. Amer. Statist. Assoc. 1987, 8-19.
102. Reichardt J., White D.R. Role models for complex networks. Eur. Phys. J. B 2007, 60:217-224.
103. T. Yang, Y. Chi, S. Zhu, R. Jin, Directed network community detection: A popularity and productivity link model, in: Proceedings of the 2010 SIAM International Conference on Data Mining, SDM'10, 2010.
104. Airoldi E.M., Blei D.M., Fienberg S.E., Xing E.P. Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 2008, 9:1981-2014.
105. Rohe K., Yu B. Co-clustering for Directed Graphs; the Stochastic Co-blockmodel and a Spectral Algorithm, Tech. Rep 2012, arXiv.
106. L. Wang, T. Lou, J. Tang, J.E. Hopcroft, Detecting community kernels in large social networks, in: Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM'11, 2011, pp. 784-793.
107. Y. Li, Z.-L. Zhang, J. Bao, Mutual or unrequited love: identifying stable clusters in social networks with uni- and bi-directional links, in: Proceedings of the 9th International Workshop on Algorithms and Models for the Web Graph, WAW'12, 2012, pp. 113-125.
108. V. Levorato, C. Petermann, Detection of communities in directed networks based on strongly p-connected components, in: IEEE International Conference on Computational Aspects of Social Networks, CASoN'11, 2011, pp. 211-216.
109. C. Giatsidis, D.M. Thilikos, M. Vazirgiannis, D-cores: measuring collaboration of directed graphs based on degeneracy, in: Proceedings of the 11th IEEE International Conference on Data Mining, ICDM'11, 2011, pp. 201-210.
110. A. Torsello, S.R. Bulo, M. Pelillo, Grouping with asymmetric affinities: a game-theoretic perspective, in: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, CVPR'06, 2006, pp. 292-299.
111. Macropol K., Singh A. Scalable discovery of best clusters on large graphs. Proc. VLDB Endow. 2010, 3(1-2):693-702.
112. J. Dean, S. Ghemawat, MapReduce: simplified data processing on large clusters, in: Proceedings of the 6th Symposium on Operating Systems Design and Implementation, vol. 6, OSDI'04, 2004, pp. 137-150.
113. J. Sun, C. Faloutsos, S. Papadimitriou, P.S. Yu, Graphscope: parameter-free mining of large time-evolving graphs, in: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'07, 2007, pp. 687-696.
114. Leskovec J., Kleinberg J., Faloutsos C. Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 2007, 1(1):1-41.
115. McGlohon M., Akoglu L., Faloutsos C. Statistical Properties of Social Networks. Chapter in Social Network Data Analytics 2011, Springer Science+Business Media. C.C. Aggarwal (Ed.).
116. D. Duan, Y. Li, Y. Jin, Z. Lu, Community mining on dynamic weighted directed graphs, in: Proceedings of the 1st ACM International Workshop on Complex Networks Meet Information & Knowledge Management, CNIKM'09, 2009, pp. 11-18.
117. H. Tong, C. Faloutsos, J.-Y. Pan, Fast random walk with restart and its applications, in: Proceedings of the Sixth International Conference on Data Mining, ICDM'06, 2006, pp. 613-622.
118. U. Brandes, M. Gaertler, D. Wagner, Experiments on graph clustering algorithms, in: 11th Annual European Symposium on Algorithms, vol. 2832, ESA'03, 2003, pp. 568-579.
119. Gfeller D., Chappelier J.-C., De Los Rios P. Finding instabilities in the community structure of complex networks. Phys. Rev. E 2005, 72:056135.
120. Karrer B., Levina E., Newman M.E.J. Robustness of community structure in networks. Phys. Rev. E 2007, 77(4):046119+.
121. Raghavan V.V., Yu C.T. A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. Pattern Anal. Mach. Intell. 1981, 3(4):393-402.
122. Meilǎ M. Comparing clusterings-an information based distance. J. Multivar. Anal. 2007, 98(5):873-895.
123. Lancichinetti A., Fortunato S. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 2009, 80(1):016118.
124. Scott J.P. Social Network Analysis: A Handbook 2000, SAGE Publications.
125. Radicchi F., Fortunato S., Vespignani A. Citation networks. Understanding Complex Systems 2012, vol. 69:233-257. Springer, Berlin/Heidelberg. A. Scharnhorst, K. Börner, P. van den Besselaar (Eds.).
126. Chen P., Redner S. Community structure of the physical review citation network. J. Inform. 2010, (4):278-290.
127. Caminati M., Stabile A. The pattern of knowledge flows between technology fields. Metroeconomica 2010, 61(2):364-397.
128. R.H. Bisseling, S. Cerav-Erbas, M. Lorenz, R. Pendavingh, C. Reeves, M. Röger, A. Verhoeven, Partitioning a call graph, in: Second International Workshop on Combinatorial Scientific Computing, 2005.
129. Pfeiffer T., Soyer O.S., Bonhoeffer S. The evolution of connectivity in metabolic networks. PLoS Biol. 2005, 3(7):e228.
130. Kim P.-J., Lee D.-Y., Jeong H. Centralized modularity of N-linked glycosylation pathways in mammalian cells. PLoS ONE 2009, 4(10):e7317.
131. Rivera C., Vakil R., Bader J. NeMo: network module identification in cytoscape. BMC Bioinformatics 2010, 11(S-1):S61+.
132. Dunne J.A., Williams R.J., Martinez N.D. Food-web structure and network theory: the role of connectance and size. PNAS 2002, 99(20):12917-12922.
133. Krause A.E., Frank K.A., Mason D.M., Ulanowicz R.E., Taylor W.W. Compartments revealed in food-web structure. Nature 2003, 282-285.
134. Guimerà R., Stouffer D.B., Sales-Pardo M., Leicht E.A., Newman M.E.J., Amaral L.A.N. Origin of compartmentalization in food webs. Ecology 2010, 91(10):2941-2951.
135. Rezende E.L., Albert E.M., Fortuna M.A., Bascompte J. Compartments in a marine food web associated with phylogeny, body mass, and habitat structure. Ecol. Lett. 2009, 12:779-788.
136. Bullmore E., Sporns O. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat. Rev. Neurosci. 2009, 10(3):186-198.
137. He Y., Evans A. Graph theoretical modeling of brain connectivity. Curr. Opin. Neurology 2010, 23(4):341-350.
138. Liao W., Ding J., Marinazzo D., Xu Q., Wang Z., Yuan C., Zhang Z., Lu G., Chen H. Small-world directed networks in the human brain: multivariate granger causality analysis of resting-state fMRI. NeuroImage 2011, 54(4):2683-2694.
139. Vertes P.E., Duke T. Effect of network topology on neuronal encoding based on spatiotemporal patterns of spikes. HFSP J. 2010, 4(3-4):153-163.
140. Cahalane D.J., Clancy B., Kingsbury M.A., Graf E., Sporns O., Finlay B.L. Network structure implied by initial axon outgrowth in rodent cortex: empirical measurement and models. PLoS ONE 2011, 6(1):e16113.
141. Pan R.K., Chatterjee N., Sinha S. Mesoscopic organization reveals the constraints governing Caenorhabditis elegans nervous system. PLoS ONE 2010, 5(2):e9240.
142. Piccardi C., Calatroni L., Bertoni F. Communities in Italian corporate networks. Physica A 2010, 389:5247-5258.
143. E. Keogh, S. Lonardi, C.A. Ratanamahatana, Towards parameter-free data mining, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'04, 2004, pp. 206-215.
144. V. Satuluri, S. Parthasarathy, Scalable graph clustering using stochastic flows: applications to community discovery, in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'09, 2009, pp. 737-746.
145. S.M. van Dongen, Graph Clustering by Flow Simulation, Ph.D. Thesis, University of Utrecht, The Netherlands, 2000.
146. U. Kang, C.E. Tsourakakis, C. Faloutsos, Pegasus: A peta-scale graph mining system implementation and observations, in: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, ICDM'09, 2009, pp. 229-238.
147. U. Kang, B. Meeder, C. Faloutsos, Spectral analysis for billion-scale graphs: discoveries and implementation, in: Proceedings of the 15th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, vol. Part II, PAKDD'11, 2011, pp. 13-25.
148. U. Kang, S. Papadimitriou, J. Sun, H. Tong, Centralities in large networks: Algorithms and observations, in: Proceedings of the Eleventh SIAM International Conference on Data Mining, SDM'11, 2011, pp. 119-130.
149. J. Leskovec, K.J. Lang, A. Dasgupta, M.W. Mahoney, Statistical properties of community structure in large social and information networks, in: Proceedings of the 17th International Conference on World Wide Web, WWW'08, 2008, pp. 695-704.
150. Leskovec J., Lang K., Dasgupta A., Mahoney M. Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 2009, 6(1):29-123.
151. F.D. Malliaros, V. Megalooikonomou, C. Faloutsos, Fast robustness estimation in large social graphs: communities and anomaly detection, in: Proceedings of the Twelfth SIAM International Conference on Data Mining, SDM'12, 2012, pp. 942-953.
152. B.A. Prakash, A. Sridharan, M. Seshadri, S. Machiraju, C. Faloutsos, Eigenspokes: surprising patterns and scalable community chipping in large graphs, in: Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining, vol. Part II, PAKDD'10, 2010, pp. 435-448.
153. J. Leskovec, D. Huttenlocher, J. Kleinberg, Signed networks in social media, in: Proceedings of the 28th International Conference on Human Factors in Computing Systems, CHI'10, 2010, pp. 1361-1370.
154. J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E.W. Luca, S. Albayrak, Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization, in: Proceedings of the Tenth SIAM International Conference on Data Mining, SDM'10, 2010, pp. 559-570.
155. Potamias M., Bonchi F., Gionis A., Kollios G. k-nearest neighbors in uncertain graphs. Proc. VLDB Endow. 2010, 3(1-2):997-1008.
156. Z. Zou, H. Gao, J. Li, Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics, in: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'10, 2010, pp. 633-642.
157. Kollios G., Potamias M., Terzi E. Clustering large probabilistic graphs. IEEE Trans. Knowl. Data Eng. 2013, 25(2):325-336.
158. Sun Y., Han J. Mining Heterogeneous Information Networks: Principles and Methodologies, Synthesis Lectures on Data Mining and Knowledge Discovery 2012, Morgan & Claypool Publishers.