{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T08:32:29Z","timestamp":1794385949205,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":128,"publisher":"Springer US","isbn-type":[{"value":"9781441984616","type":"print"},{"value":"9781441984623","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-8462-3_4","type":"book-chapter","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T08:24:37Z","timestamp":1300263877000},"page":"79-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Community Discovery in Social Networks: Applications, Methods and Emerging Trends"],"prefix":"10.1007","author":[{"given":"S.","family":"Parthasarathy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.","family":"Ruan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Satuluri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"J. Abello, P. Pardalos, and MGC Resende. On maximum clique problems in very large graphs. In External memory algorithms, pages 119\u2013130. American Mathematical Society, 1999.","DOI":"10.1090\/dimacs\/050\/06"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"L.A. Adamic and N. Glance. The political blogosphere and the 2004 US election: divided they blog. In Proceedings of the 3rd international workshop on Link discovery, page 43. ACM, 2005.","DOI":"10.1145\/1134271.1134277"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Charu C. Aggarwal, Yuchen Zhao, and Philip S. Yu. On clustering graph streams. In SDM, pages 478\u2013489, 2010.","DOI":"10.1137\/1.9781611972801.42"},{"issue":"6749","key":"4_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"R. Albert, H. Jeong, and A.L. Barab\u00e1si. Diameter of the World-Wide Web. Nature, 401(6749):130\u2013131, 1999.","journal-title":"Nature"},{"issue":"12","key":"4_CR5","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0968-0004(02)02204-1","volume":"27","author":"P. Aloy","year":"2002","unstructured":"P. Aloy and R.B. Russell. The third dimension for protein interactions and complexes. Trends in biochemical sciences, 27(12):633\u2013638, 2002.","journal-title":"Trends in biochemical sciences"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS \u201906: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 475\u2013486, Washington, DC, USA, 2006. IEEE Computer Society.","DOI":"10.1109\/FOCS.2006.44"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"R. Andersen and K.J. Lang. Communities from seed sets. In WWW \u201906: Proceedings of the 15th international conference on World Wide Web, page 232. ACM, 2006.","DOI":"10.1145\/1135777.1135814"},{"key":"4_CR8","unstructured":"S. Asur, S. Parthasarathy, and D. Ucar. An ensemble approach for clustering scalefree graphs. In LinkKDD workshop, 2006."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"S. Asur, S. Parthasarathy, and D. Ucar. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 913\u2013921, New York, NY, USA, 2007. ACM.","DOI":"10.1145\/1281192.1281290"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Sitaram Asur and Srinivasan Parthasarathy. A viewpoint-based approach for interaction graph analysis. In KDD \u201909: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 79\u201388, New York, NY, USA, 2009. ACM.","DOI":"10.1145\/1557019.1557035"},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1038\/scientificamerican0503-60","volume":"288","author":"A.L. Barab\u00e1si","year":"2003","unstructured":"A.L. Barab\u00e1si and E. Bonabeau. Scale-free networks. Scientific American, 288(5):60, 2003.","journal-title":"Scientific American"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1119\/1.1538577","volume":"71","author":"A.L. Barab\u00e1si","year":"2003","unstructured":"A.L. Barab\u00e1si and RE Crandall. Linked: The new science of networks. American journal of Physics, 71:409, 2003.","journal-title":"American journal of Physics"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S.T. Barnard","year":"1994","unstructured":"S.T. Barnard and H.D. Simon. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency Practice and Experience, 6(2):101\u2013118, 1994.","journal-title":"Concurrency Practice and Experience"},{"issue":"16","key":"4_CR14","doi-asserted-by":"crossref","first-page":"9383","DOI":"10.1073\/pnas.1633576100","volume":"100","author":"J. Bascompte","year":"2003","unstructured":"J. Bascompte, P. Jordano, C.J. Meli\u00e1n, and J.M. Olesen. The nested assembly of plant\u2013animal mutualistic networks. Proceedings of the National Academy of Sciences of the United States of America, 100(16):9383, 2003.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"M.L. Bech and E. Atalay. The topology of the federal funds market. Working Paper Series, 2008.","DOI":"10.2139\/ssrn.1299021"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"T.Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD \u201906: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, page 528. ACM, 2006.","DOI":"10.1145\/1150402.1150462"},{"key":"4_CR17","unstructured":"Board on Army Science and Technology. Strategy for an Army Center for Network Science, Technology, and Experim entation. The National Academies Press, 2007."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On finding graph clusterings with maximum modularity. In Graph-Theoretic Concepts in Computer Science, pages 121\u2013132. Springer, 2007.","DOI":"10.1007\/978-3-540-74839-7_12"},{"issue":"8-13","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"A.Z. Broder","year":"1997","unstructured":"A.Z. Broder, S.C. Glassman, M.S. Manasse, and G. Zweig. Syntactic clustering of the web. Computer Networks and ISDN Systems, 29(8-13):1157\u20131166, 1997.","journal-title":"Computer Networks and ISDN Systems"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"S. Brohee","year":"2006","unstructured":"S. Brohee and J. Van Helden. Evaluation of clustering algorithms for protein-protein interaction networks. BMC bioinformatics, 7(1):488, 2006.","journal-title":"BMC bioinformatics"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM \u201908: Proceedings of the international conference on Web search and web data mining, pages 95\u2013106, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1341531.1341547"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"G. Buehrer, S. Parthasarathy, and M. Goyder. Data mining on the cell broadband engine. In Proceedings of the 22nd annual international conference on Supercomputing, pages 26\u201335. ACM, 2008.","DOI":"10.1145\/1375527.1375534"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"D. Cai, Z. Shao, X. He, X. Yan, and J. Han. Mining hidden community in heterogeneous social networks. In Proceedings of the 3rd international workshop on Link discovery, page 65. ACM, 2005.","DOI":"10.1145\/1134271.1134280"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D. Chakrabarti","year":"2006","unstructured":"D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv., 38(1):2, 2006.","journal-title":"ACM Comput. Surv."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In KDD \u201906: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 554\u2013560. ACM New York, NY, USA, 2006.","DOI":"10.1145\/1150402.1150467"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Y. Chi, X. Song, K. Hino, and B.L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness, October 18 2007. US Patent App. 11\/874,395.","DOI":"10.1145\/1281192.1281212"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"F. Chung. Spectral graph theory. CBMS Regional Conference Series in Mathematics, 1997.","DOI":"10.1090\/cbms\/092"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F. Chung","year":"2005","unstructured":"F. Chung. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics, 9(1):1\u201319, 2005.","journal-title":"Annals of Combinatorics"},{"issue":"6","key":"4_CR29","doi-asserted-by":"publisher","first-page":"66111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"A. Clauset, M.E.J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):66111, 2004.","journal-title":"Physical Review E"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0197-2456(86)90046-2","volume":"7","author":"R. DerSimonian","year":"1986","unstructured":"R. DerSimonian and N. Laird. Meta-analysis in clinical trials* 1. Controlled clinical trials, 7(3):177\u2013188, 1986.","journal-title":"Controlled clinical trials"},{"issue":"11","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"I.S. Dhillon","year":"2007","unstructured":"I.S. Dhillon, Y. Guan, and B. Kulis. Weighted Graph Cuts without Eigenvectors: AMultilevel Approach. IEEE Trans. Pattern Anal. Mach. Intell., 29(11):1944\u20131957, 2007.","journal-title":"IEEE Trans. Pattern Anal. Mach."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"P. Domingos and M. Richardson. Mining the network value of customers. In KDD \u201901: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 57\u201366. ACM, 2001.","DOI":"10.1145\/502512.502525"},{"issue":"4","key":"4_CR33","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1046\/j.1461-0248.2002.00354.x","volume":"5","author":"J.A. Dunne","year":"2002","unstructured":"J.A. Dunne, R.J. Williams, and N.D. Martinez. Network structure and biodiversity loss in food webs: robustness increases with connectance. Ecology Letters, 5(4):558\u2013567, 2002.","journal-title":"Ecology Letters"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, page 262. ACM, 1999.","DOI":"10.1145\/316188.316229"},{"issue":"2","key":"4_CR35","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(2):298\u2013305, 1973.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"G.W. Flake, S. Lawrence, and C.L. Giles. Efficient identification of web communities. In KDD \u201900: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, page 160. ACM, 2000.","DOI":"10.1145\/347090.347121"},{"issue":"3","key":"4_CR37","first-page":"66","volume":"35","author":"G.W. Flake","year":"2002","unstructured":"G.W. Flake, S. Lawrence, C.L. Giles, and F.M. Coetzee. Selforganization of the web and identification of communities. Communities, 35(3):66\u201371, 2002.","journal-title":"Communities"},{"issue":"1","key":"4_CR38","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S. Fortunato","year":"2007","unstructured":"S. Fortunato and M. Barth\u00e9lemy. Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36, 2007.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey and L. Johnson. Some simplified NP-complete graph problems. Theoretical computer science, 1(3):237\u2013267, 1976.","journal-title":"Theoretical computer science"},{"key":"4_CR40","unstructured":"D. Gibson, R. Kumar, and A. Tomkins. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB \u201905: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30-September 2, 2005, page 721. ACM, 2005."},{"issue":"12","key":"4_CR41","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"M. Girvan and M.E.J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821, 2002.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"W. Glanzel and A. Schubert. Analysing scientific networks through coauthorship. Handbook of quantitative science and technology research, pages 257\u2013276, 2004.","DOI":"10.1007\/1-4020-2755-9_12"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"I. Guy, M. Jacovi, E. Shahar, N. Meshulam, V. Soroka, and S. Farrell. Harvesting with SONAR: the value of aggregating social network information. In Proceeding of the twenty-sixth annual SIGCHI conference on Human factors in computing systems, pages 1017\u20131026. ACM, 2008.","DOI":"10.1145\/1357054.1357212"},{"key":"4_CR44","unstructured":"G. C. Homans. The Human Group. New York: Harcourt, Brace, 1950."},{"key":"4_CR45","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11871637_21","volume":"4213","author":"J. Huang","year":"2006","unstructured":"J. Huang, T. Zhu, and D. Schuurmans. Web communities identification from random walks. Lecture Notes in Computer Science, 4213:187, 2006.","journal-title":"Lecture Notes in Computer Science"},{"issue":"1482","key":"4_CR46","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1098\/rspb.2001.1800","volume":"268","author":"R.F. Cancho","year":"2001","unstructured":"R.F. i Cancho. The small world of human language. Proceedings of the Royal Society B: Biological Sciences, 268(1482):2261\u20132265, 2001.","journal-title":"Proceedings of the Royal Society B: Biological Sciences"},{"issue":"6833","key":"4_CR47","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H. Jeong","year":"2001","unstructured":"H. Jeong, S.P. Mason, A.L. Barab\u00e1si, and Z.N. Oltvai. Lethality and centrality in protein networks. Nature, 411(6833):41\u201342, 2001.","journal-title":"Nature"},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"U. Kang, C. Tsourakakis, A.P. Appel, C. Faloutsos, and J. Leskovec. Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations. In SIAM International Conference on Data Mining, 2010.","DOI":"10.1137\/1.9781611972801.48"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"U Kang, C.E Tsourakakis, and C. Faloutsos. Pegasus: Mining peta-scale graphs. Knowledge and Information Systems, 2010.","DOI":"10.1007\/s10115-010-0305-0"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"R. Kannan, S. Vempala, and A. Veta. On clusterings-good, bad and spectral. In FOCS \u201900, page 367. IEEE Computer Society, 2000.","DOI":"10.1109\/SFCS.2000.892125"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20, 1999.","DOI":"10.1137\/S1064827595287997"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"L. Kaufman and PJ Rousseeuw. Finding groups in data; an introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics Section (EUA)., 1990.","DOI":"10.1002\/9780470316801"},{"key":"4_CR53","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, and \u00c9. Tardos. Maximizing the spread of influence through a social network. In KDD \u201903: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137\u2013146, New York, NY, USA, 2003. ACM.","DOI":"10.1145\/956750.956769"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"B. Kernighan and S. Lin. An Efficient Heuristic Procedure for partitioning graphs. The Bell System Technical J., 49, 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"issue":"1","key":"4_CR55","doi-asserted-by":"crossref","first-page":"622","DOI":"10.14778\/1687627.1687698","volume":"2","author":"M.S. Kim","year":"2009","unstructured":"M.S. Kim and J. Han. A particle-and-density based evolutionary clustering method for dynamic networks. Proceedings of the VLDB Endowment, 2(1):622\u2013633, 2009.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4_CR56","unstructured":"Y. Koren. The BellKor Solution to the Netflix Grand Prize. KorBell Team\u2019s Report to Netflix, 2009."},{"key":"4_CR57","doi-asserted-by":"crossref","unstructured":"K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. Lecture notes in computer science, pages 325\u2013337, 2004.","DOI":"10.1007\/978-3-540-25960-2_25"},{"issue":"11","key":"4_CR58","doi-asserted-by":"publisher","first-page":"118703","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"E.A. Leicht","year":"2008","unstructured":"E.A. Leicht and M.E.J. Newman. Community structure in directed networks. Physical review letters, 100(11):118703, 2008.","journal-title":"Physical review letters"},{"issue":"1","key":"4_CR59","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J. Leskovec","year":"2007","unstructured":"J. Leskovec, L.A. Adamic, and B.A. Huberman. The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1):5, 2007.","journal-title":"ACM Transactions on the Web (TWEB)"},{"key":"4_CR60","unstructured":"J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. CoRR, abs\/0810.1355, 2008."},{"key":"4_CR61","doi-asserted-by":"crossref","unstructured":"J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW \u201908, pages 695\u2013704, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1367497.1367591"},{"issue":"9","key":"4_CR62","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1101\/gr.1224503","volume":"13","author":"L. Li","year":"2003","unstructured":"L. Li, C.J. Stoeckert, and D.S. Roos. OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res, 13(9):2178\u20132189, September 2003.","journal-title":"Genome Res"},{"key":"4_CR63","doi-asserted-by":"crossref","unstructured":"Y.R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B.L. Tseng. Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In WWW \u201908: Proceeding of the 17th international conference on World Wide Web, pages 685\u2013694, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1367497.1367590"},{"issue":"2","key":"4_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1514888.1514891","volume":"3","author":"Y.R. Lin","year":"2009","unstructured":"Y.R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B.L. Tseng. Analyzing communities and their evolutions in dynamic social networks. ACM Transactions on Knowledge Discovery from Data (TKDD), 3(2):1\u201331, 2009.","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"key":"4_CR65","doi-asserted-by":"crossref","unstructured":"D. Lusseau. The emergent properties of a dolphin social network. Proceedings of the Royal Society of London. Series B: Biological Sciences, 270(Suppl 2):S186, 2003.","DOI":"10.1098\/rsbl.2003.0057"},{"key":"4_CR66","doi-asserted-by":"crossref","unstructured":"M. Meila andW. Pentney. Clustering by weighted cuts in directed graphs. In Proceedings of the 7th SIAM International Conference on Data Mining, pages 135\u2013144. Citeseer, 2007.","DOI":"10.1137\/1.9781611972771.13"},{"key":"4_CR67","unstructured":"M. Meila and J. Shi. A random walks view of spectral segmentation. AI and Statistics (AISTATS), 2001, 2001."},{"key":"4_CR68","doi-asserted-by":"crossref","unstructured":"J. Memmott, N.M. Waser, and M.V. Price. Tolerance of pollination networks to species extinctions. Proceedings of the Royal Society of London. Series B: Biological Sciences, 271(1557):2605, 2004.","DOI":"10.1098\/rspb.2004.2909"},{"issue":"3","key":"4_CR69","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jtbi.2001.2460","volume":"214","author":"J.M. Montoya","year":"2002","unstructured":"J.M. Montoya et al. Small world patterns in food webs. Journal of theoretical biology, 214(3):405\u2013412, 2002.","journal-title":"Journal of theoretical biology"},{"key":"4_CR70","doi-asserted-by":"crossref","unstructured":"F. Moser, R. Ge, and M. Ester. Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 510\u2013519. ACM New York, NY, USA, 2007.","DOI":"10.1145\/1281192.1281248"},{"issue":"8-9","key":"4_CR71","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/S0048-7333(02)00070-7","volume":"31","author":"F. Murray","year":"2002","unstructured":"F. Murray. Innovation as co-evolution of scientific and technological networks: exploring tissue engineering. Research Policy, 31(8-9):1389\u20131403, 2002.","journal-title":"Research Policy"},{"key":"4_CR72","unstructured":"S.F. Nadel. The Theory of Social Structure. London: Cohen and West, 1957."},{"key":"4_CR73","doi-asserted-by":"crossref","unstructured":"R.A. Negoescu, B. Adams, D. Phung, S. Venkatesh, and D. Gatica-Perez. Flickr hypergroups. In Proceedings of the seventeen ACM international conference on Multimedia, pages 813\u2013816. ACM, 2009.","DOI":"10.1145\/1631272.1631421"},{"issue":"6","key":"4_CR74","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"M. E. J. Newman","year":"2004","unstructured":"M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69(6):066133, 2004.","journal-title":"Physical Review E"},{"issue":"20","key":"4_CR75","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"M.E.J. Newman","year":"2002","unstructured":"M.E.J. Newman. Assortative mixing in networks. Physical Review Letters, 89(20):208701, 2002.","journal-title":"Physical Review Letters"},{"issue":"1","key":"4_CR76","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"M.E.J. Newman","year":"2005","unstructured":"M.E.J. Newman. A measure of betweenness centrality based on random walks. Social networks, 27(1):39\u201354, 2005.","journal-title":"Social networks"},{"key":"4_CR77","doi-asserted-by":"crossref","unstructured":"M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577, 2006.","DOI":"10.1073\/pnas.0601602103"},{"issue":"2","key":"4_CR78","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"Feb 2004","unstructured":"M.E.J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, Feb 2004.","journal-title":"Phys. Rev. E"},{"issue":"455","key":"4_CR79","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1198\/016214501753208735","volume":"96","author":"K. Nowicki","year":"2001","unstructured":"K. Nowicki and T.A.B. Snijders. Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96(455):1077\u20131087, 2001.","journal-title":"Journal of the American Statistical Association"},{"key":"4_CR80","doi-asserted-by":"crossref","unstructured":"L. Palen and S.B. Liu. Citizen communications in crisis: anticipating a future of ICT-supported public participation. In Proceedings of the SIGCHI conference on Human factors in computing systems, page 736. ACM, 2007.","DOI":"10.1145\/1240624.1240736"},{"key":"4_CR81","doi-asserted-by":"crossref","unstructured":"S. Papadimitriou and J. Sun. Disco: Distributed co-clustering with Map-Reduce: A case study towards petabyte-scale end-to-end mining. In Eighth IEEE International Conference on Data Mining, 2008. ICDM\u201908, pages 512\u2013521, 2008.","DOI":"10.1109\/ICDM.2008.142"},{"key":"4_CR82","doi-asserted-by":"crossref","unstructured":"S. Parthasarathy. Data mining at the crossroads: successes, failures and learning from them. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, page 1055. ACM, 2007.","DOI":"10.1145\/1281192.1281311"},{"key":"4_CR83","doi-asserted-by":"crossref","unstructured":"S. Parthasarathy, S. Tatikonda, G. Buehrer, and A. Ghoting. Next Generation of Data Mining, chapter Architecture Conscious Data Mining: Current Directions and Future Outlook, pages 261\u2013280. Chapman and Hall\/CRC, 2008.","DOI":"10.1201\/9781420085877.ch13"},{"key":"4_CR84","unstructured":"N. Pathak, C. DeLong, A. Banerjee, and K. Erickson. Social topic models for community extraction. In The 2nd SNA-KDD Workshop, volume 8, 2008."},{"key":"4_CR85","doi-asserted-by":"crossref","unstructured":"A. Perer and B. Shneiderman. Balancing systematic and flexible exploration of social networks. IEEE Transactions on Visualization and Computer Graphics, pages 693\u2013700, 2006.","DOI":"10.1109\/TVCG.2006.122"},{"issue":"1","key":"4_CR86","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1038\/ng708","volume":"29","author":"J. Podani","year":"2001","unstructured":"J. Podani, Z.N. Oltvai, H. Jeong, B. Tombor, A.L. Barab\u00e1si, and E. Szathmary. Comparable system-level organization of Archaea and Eukaryotes. Nature genetics, 29(1):54\u201356, 2001.","journal-title":"Nature genetics"},{"issue":"1","key":"4_CR87","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/4236.989007","volume":"6","author":"P. Raghavan","year":"2002","unstructured":"P. Raghavan. Social networks: from the Web to the enterprise. IEEE Internet Computing, 6(1):91\u201394, 2002.","journal-title":"IEEE Internet Computing"},{"key":"4_CR88","doi-asserted-by":"crossref","unstructured":"P.K. Reddy, M. Kitsuregawa, P. Sreekanth, and S.S. Rao. A graph based approach to extract a neighborhood customer community for collaborative filtering. In Databases in networked information systems: second international workshop, DNIS 2002, Aizu, Japan, December 16-18, 2002: proceedings, page 188. Springer-Verlag New York Inc, 2002.","DOI":"10.1007\/3-540-36233-9_15"},{"issue":"3","key":"4_CR89","doi-asserted-by":"publisher","first-page":"619","DOI":"10.2307\/1945514","volume":"21","author":"S.A. Rice","year":"1927","unstructured":"S.A. Rice. The identification of blocs in small political bodies. The American Political Science Review, 21(3):619\u2013627, 1927.","journal-title":"The American Political Science Review"},{"key":"4_CR90","doi-asserted-by":"crossref","unstructured":"Y. Richter, E. Yom-Tov, and N. Slonim. Predicting customer churn in mobile networks through analysis of social groups. In Proceedings of the 2010 SIAM International Conference on Data Mining, 2010.","DOI":"10.1137\/1.9781611972801.64"},{"key":"4_CR91","unstructured":"E.M. Rogers. Diffusion of innovations. Free Pr, 1995."},{"key":"4_CR92","unstructured":"E.M. Rogers and D.L. Kincaid. Communication networks: Toward a new paradigm for research. Free Pr, 1981."},{"key":"4_CR93","doi-asserted-by":"crossref","unstructured":"V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. In KDD \u201909, pages 737\u2013746, New York, NY, USA, 2009. ACM.","DOI":"10.1145\/1557019.1557101"},{"key":"4_CR94","unstructured":"V. Satuluri and S. Parthasarathy. Symmetrizations for clustering directed graphs. In Workshop on Mining and Learning with Graphs, MLG 2010, 2010. Also available as technical report from ftp:\/\/ftp.cse.ohio-state.edu\/pub\/tech-report\/2010\/TR12.pdf."},{"key":"4_CR95","doi-asserted-by":"crossref","unstructured":"V. Satuluri, S. Parthasarathy, and D. Ucar. Markov Clustering of Protein Interaction Networks with Improved Balance and Scalability. In Proceedings of the ACM Conference on Bioinformatics and Computational Biology, 2010.","DOI":"10.1145\/1854776.1854812"},{"issue":"8","key":"4_CR96","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik. Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888\u2013905, 2000.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1480","key":"4_CR97","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1098\/rspb.2001.1767","volume":"268","author":"R.V. Sol\u00e9","year":"2001","unstructured":"R.V. Sol\u00e9 and M. Montoya. Complexity and fragility in ecological networks. Proceedings of the Royal Society of London. Series B: Biological Sciences, 268(1480):2039, 2001.","journal-title":"Proceedings of the Royal Society of London. Series B: Biological Sciences"},{"key":"4_CR98","doi-asserted-by":"crossref","unstructured":"R.V. Sol\u00e9 and R. Pastor-Satorras. Complex networks in genomics and proteomics. Handbook of Graphs and Networks, pages 147\u2013169, 2002.","DOI":"10.1002\/3527602755.ch7"},{"issue":"7","key":"4_CR99","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1109\/9.935056","volume":"46","author":"E.D. Sontag","year":"2001","unstructured":"E.D. Sontag. Structure and stability of certain chemical networks andapplications to the kinetic proofreading model of T-cell receptor signaltransduction. IEEE transactions on automatic control, 46(7):1028\u20131047, 2001.","journal-title":"IEEE transactions on automatic control"},{"key":"4_CR100","doi-asserted-by":"crossref","unstructured":"D.A. Spielman and N. Srivastava. Graph sparsification by effective resistances. In STOC \u201908: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 563\u2013568, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1374376.1374456"},{"key":"4_CR101","doi-asserted-by":"crossref","unstructured":"D.A. Spielman and S.H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 81\u201390. ACM New York, NY, USA, 2004.","DOI":"10.1145\/1007352.1007372"},{"issue":"5","key":"4_CR102","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/S0022-2836(03)00239-0","volume":"327","author":"E. Sprinzak","year":"2003","unstructured":"E. Sprinzak, S. Sattath, and H. Margalit. How reliable are experimental protein-protein interaction data? Journal of molecular biology, 327(5):919\u2013923, 2003.","journal-title":"Journal of molecular biology"},{"issue":"2","key":"4_CR103","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/846183.846188","volume":"1","author":"J. Srivastava","year":"2000","unstructured":"J. Srivastava, R. Cooley, M. Deshpande, and P.N. Tan. Web usage mining: Discovery and applications of usage patterns from web data. ACM SIGKDD Explorations Newsletter, 1(2):23, 2000.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"4_CR104","unstructured":"M. Steenstrup. Cluster-based networks. In Ad hoc networking, page 138. Addison-Wesley Longman Publishing Co., Inc., 2001."},{"key":"4_CR105","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1162\/153244303321897735","volume":"3","author":"A. Strehl","year":"2003","unstructured":"A. Strehl and J. Ghosh. Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research, 3:583\u2013617, 2003.","journal-title":"The Journal of Machine Learning Research"},{"key":"4_CR106","doi-asserted-by":"crossref","unstructured":"J. Sun, C. Faloutsos, S. Papadimitriou, and P.S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 687\u2013696. ACM New York, NY, USA, 2007.","DOI":"10.1145\/1281192.1281266"},{"key":"4_CR107","doi-asserted-by":"crossref","unstructured":"Y. Sun, J. Han, P. Zhao, Z. Yin, H. Cheng, and T. Wu. RankClus: integrating clustering with ranking for heterogeneous information network analysis. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, pages 565\u2013576. ACM, 2009.","DOI":"10.1145\/1516360.1516426"},{"key":"4_CR108","doi-asserted-by":"crossref","unstructured":"Y. Sun, Y. Yu, and J. Han. Ranking-based clustering of heterogeneous information networks with star network schema. In KDD \u201909: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 797\u2013806. ACM, 2009.","DOI":"10.1145\/1557019.1557107"},{"issue":"1","key":"4_CR109","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/s00442-006-0553-6","volume":"151","author":"S.R. Sundaresan","year":"2007","unstructured":"S.R. Sundaresan, I.R. Fischhoff, J. Dushoff, and D.I. Rubenstein. Network metrics reveal differences in social organization between two fission\u2013fusion species, Grevy\u2019s zebra and onager. Oecologia, 151(1):140\u2013149, 2007.","journal-title":"Oecologia"},{"key":"4_CR110","volume-title":"Introduction to data mining","author":"P.N. Tan","year":"2006","unstructured":"P.N. Tan, M. Steinbach, and V. Kumar. Introduction to data mining. Pearson Addison Wesley Boston, 2006."},{"key":"4_CR111","doi-asserted-by":"crossref","unstructured":"C. Tantipathananandh, T. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, page 726. ACM, 2007.","DOI":"10.1145\/1281192.1281269"},{"key":"4_CR112","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-1-4612-1516-5_11","volume":"105","author":"S.H. Teng","year":"1999","unstructured":"S.H. Teng. Coarsening, sampling, and smoothing: Elements of the multilevel method. Algorithms for Parallel Processing, 105:247\u2013276, 1999.","journal-title":"Algorithms for Parallel Processing"},{"issue":"4","key":"4_CR113","doi-asserted-by":"publisher","first-page":"507","DOI":"10.2307\/257851","volume":"4","author":"N.M. Tichy","year":"1979","unstructured":"N.M. Tichy, M.L. Tushman, and C. Fombrun. Social network analysis for organizations. Academy of Management Review, 4(4):507\u2013519, 1979.","journal-title":"Academy of Management Review"},{"issue":"6770","key":"4_CR114","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1038\/35001009","volume":"403","author":"P. Uetz","year":"2000","unstructured":"P. Uetz, L. Giot, G. Cagney, T.A. Mansfield, R.S. Judson, J.R. Knight, V. Lockshon, D. a nd Narayan, M. Srinivasan, P. Pochart, et al. A comprehensive analysis of protein\u2013protein interactions in Saccharomyces cerevisiae. Nature, 403(6770):623\u2013627, 2000.","journal-title":"Nature"},{"key":"4_CR115","unstructured":"S. Van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000."},{"issue":"4","key":"4_CR116","first-page":"519","volume":"35","author":"F.A. Von Hayek","year":"1945","unstructured":"F.A. Von Hayek. The use of knowledge in society. American Economic Review, 35(4):519\u2013530, 1945.","journal-title":"American Economic Review"},{"issue":"4","key":"4_CR117","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U. Von Luxburg","year":"2007","unstructured":"U. Von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395\u2013416, 2007.","journal-title":"Statistics and Computing"},{"issue":"1478","key":"4_CR118","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1098\/rspb.2001.1711","volume":"268","author":"A. Wagner","year":"2001","unstructured":"A. Wagner and D.A. Fell. The small world inside large metabolic networks. Proceedings of the Royal Society of London. Series B: Biological Sciences, 268(1478):1803, 2001.","journal-title":"Proceedings of the Royal Society of London. Series B: Biological Sciences"},{"key":"4_CR119","doi-asserted-by":"crossref","unstructured":"N. Wang, S. Parthasarathy, K.L. Tan, and A.K.H. Tung. CSV: visualizing and mining cohesive subgraphs. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 445\u2013458. ACM, 2008.","DOI":"10.1145\/1376616.1376663"},{"key":"4_CR120","first-page":"1449","volume":"18","author":"X. Wang","year":"2006","unstructured":"X. Wang, N. Mohanty, and A. McCallum. Group and topic discovery from relations and their attributes. Advances in Neural Information Processing Systems, 18:1449, 2006.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"4_CR121","doi-asserted-by":"crossref","unstructured":"S. Wasserman and K. Faust. Social network analysis: Methods and applications. Cambridge Univ Pr, 1994.","DOI":"10.1017\/CBO9780511815478"},{"key":"4_CR122","unstructured":"D.J. Watts. Small worlds: the dynamics of networks between order and randomness. Princeton Univ Press, 2003."},{"issue":"6","key":"4_CR123","doi-asserted-by":"publisher","first-page":"661","DOI":"10.2307\/2088670","volume":"20","author":"R.S. Weiss","year":"1955","unstructured":"R.S.Weiss and E. Jacobson. A method for the analysis of the structure of complex organizations. American Sociological Review, 20(6):661\u2013668, 1955.","journal-title":"American Sociological Review"},{"issue":"6","key":"4_CR124","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1064830.1064834","volume":"48","author":"J. Xu","year":"2005","unstructured":"J. Xu and H. Chen. Criminal network analysis and visualization. Commun. ACM, 48(6):100\u2013107, 2005.","journal-title":"Commun. ACM"},{"key":"4_CR125","doi-asserted-by":"crossref","unstructured":"X. Yang, S. Asur, S. Parthasarathy, and S. Mehta. A visual-analytic toolkit for dynamic interaction graphs. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1016\u20131024. ACM, 2008.","DOI":"10.1145\/1401890.1402011"},{"issue":"4","key":"4_CR126","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W.W. Zachary","year":"1977","unstructured":"W.W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33(4):452\u2013473, 1977.","journal-title":"Journal of Anthropological Research"},{"key":"4_CR127","doi-asserted-by":"crossref","unstructured":"D. Zhou, J. Huang, and B. Scholkopf. Learning from labeled and unlabeled data on a directed graph. In ICML \u201905, pages 1036\u20131043, 2005.","DOI":"10.1145\/1102351.1102482"},{"key":"4_CR128","doi-asserted-by":"crossref","unstructured":"D. Zhou, E. Manavoglu, J. Li, C.L. Giles, and H. Zha. Probabilistic models for discovering e-communities. In WWW \u201906: Proceedings of the 15th international conference onWorldWideWeb, page 182. ACM, 2006.","DOI":"10.1145\/1135777.1135807"}],"container-title":["Social Network Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-8462-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T10:26:43Z","timestamp":1741084003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-8462-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441984616","9781441984623"],"references-count":128,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_4","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4419-8462-3","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"17 March 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}