{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:46:04Z","timestamp":1725745564306},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402845"},{"type":"electronic","value":"9783642402852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40285-2_35","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T12:02:58Z","timestamp":1376740978000},"page":"404-418","source":"Crossref","is-referenced-by-count":2,"title":["Fast Community Detection"],"prefix":"10.1007","author":[{"given":"Yi","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y.-Y. Ahn","year":"2010","unstructured":"Ahn, Y.-Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature\u00a0466, 761 (2010)","journal-title":"Nature"},{"key":"35_CR2","unstructured":"Baumes, J., Goldberg, M.K., Krishnamoorthy, M.S., Magdon-Ismail, M., Preston, N.: Finding communities by clustering a graph into overlapping subgraphs. In: IADIS AC, pp. 97\u2013104 (2005)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11427995_3","volume-title":"Intelligence and Security Informatics","author":"J. Baumes","year":"2005","unstructured":"Baumes, J., Goldberg, M., Magdon-Ismail, M.: Efficient identification of overlapping communities. In: Kantor, P., Muresan, G., Roberts, F., Zeng, D.D., Wang, F.-Y., Chen, H., Merkle, R.C. (eds.) ISI 2005. LNCS, vol.\u00a03495, pp. 27\u201336. Springer, Heidelberg (2005)"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"026132","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A. Clauset","year":"2005","unstructured":"Clauset, A.: Finding local community structure in networks. Phys. Rev. E\u00a072, 026132 (2005)","journal-title":"Phys. Rev. E"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E\u00a070, 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Coscia, M., Rossetti, G., Giannotti, F., Pedreschi, D.: Demon: a local-first discovery method for overlapping communities. CoRR (2012)","DOI":"10.1145\/2339530.2339630"},{"key":"35_CR7","unstructured":"CUDA-Zone, \n                    \n                      http:\/\/www.nvidia.com\/object\/what_is_cuda_new.html"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Physical Review E 68 (2003)","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Pei, X., Wang, B., Xu, L.: Community detection in large-scale social networks. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, WebKDD\/SNA-KDD 2007, pp. 16\u201325. ACM (2007)","DOI":"10.1145\/1348549.1348552"},{"key":"35_CR10","unstructured":"Email-URV, \n                    \n                      http:\/\/deim.urv.cat\/~aarenas\/data\/welcome.htm"},{"key":"35_CR11","volume-title":"VALUETOOLS 2009","author":"S. Fortunato","year":"2009","unstructured":"Fortunato, S., Lancichinetti, A.: Community detection algorithms: a comparative analysis: invited presentation, extended abstract. In: VALUETOOLS 2009. ICST, Brussels (2009)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"I.F. Gergely Palla","year":"2005","unstructured":"Gergely Palla, I.F., Derenyi, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435, 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"12","key":"35_CR13","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Goldberg, M.K., Kelley, S., Magdon-Ismail, M., Mertsalov, K., Wallace, A.: Finding overlapping communities in social networks. In: SocialCom\/PASSAT, pp. 104\u2013113 (2010)","DOI":"10.1109\/SocialCom.2010.24"},{"key":"35_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-74976-9_12","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"S. Gregory","year":"2007","unstructured":"Gregory, S.: An algorithm to find overlapping community structure in networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 91\u2013102. Springer, Heidelberg (2007)"},{"key":"35_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-87479-9_45","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"S. Gregory","year":"2008","unstructured":"Gregory, S.: A fast algorithm to find overlapping communities in networks. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 408\u2013423. Springer, Heidelberg (2008)"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-45294-X_3","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"D. Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: On clustering using random walks. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, p. 18. Springer, Heidelberg (2001)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Jin, D., Yang, B., Baquero, C., Liu, D., He, D., Liu, J.: A Markov random walk under constraint for discovering overlapping communities in complex networks. Journal of Statistical Mechanics: Theory and Experiment\u00a0(2011)","DOI":"10.1088\/1742-5468\/2011\/05\/P05031"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics\u00a011 (2009)","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics) 78(4) (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web. ACM (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. TKDD 1(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"issue":"4","key":"35_CR23","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D. Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology\u00a054(4), 396\u2013405 (2003)","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"35_CR24","volume-title":"Computing with Social Trust","author":"P. Massa","year":"2009","unstructured":"Massa, P., Avesani, P.: Trust metrics in recommender systems. In: Computing with Social Trust. Springer, London (2009)"},{"key":"35_CR25","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E\u00a069, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. Journal of statistical Mechanics: Theory and Experiment (2009)","DOI":"10.1088\/1742-5468\/2009\/03\/P03024"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11569596_31","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"P. Pons","year":"2005","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 284\u2013293. Springer, Heidelberg (2005)"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Prat-P\u00e9rez, A., Dominguez-Sal, D., Brunat, J.M., Larriba-Pey, J.-L.: Shaping communities out of triangles. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012. ACM (2012)","DOI":"10.1145\/2396761.2398496"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences of the United States of America 105 (2008)","DOI":"10.1073\/pnas.0706851105"},{"issue":"1","key":"35_CR30","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"35_CR31","unstructured":"SNAP, \n                    \n                      http:\/\/snap.stanford.edu\/data"},{"key":"35_CR32","unstructured":"TrustLet, \n                    \n                      http:\/\/www.trustlet.org\/"},{"key":"35_CR33","unstructured":"van Dongen, S.M.: Graph clustering by flow simulation. PhD thesis, University of Utrecht (2000)"},{"key":"35_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-30220-6_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Xie","year":"2012","unstructured":"Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol.\u00a07302, pp. 25\u201336. Springer, Heidelberg (2012)"},{"key":"35_CR35","unstructured":"Yan, B., Gregory, S.: Detecting communities in networks by merging cliques. CoRR (2012)"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, MDS 2012. ACM (2012)","DOI":"10.1109\/ICDM.2012.138"},{"key":"35_CR37","unstructured":"Yen, L., Vanvyve, L., Wouters, D., Fouss, F., Verleysen, F., Saerens, M.: Clustering using a random-walk based distance measure. In: Proceedings of ESANN 2005 (2005)"},{"issue":"1","key":"35_CR38","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.physa.2006.07.023","volume":"374","author":"S. Zhang","year":"2007","unstructured":"Zhang, S., Wang, R.S., Zhang, X.S.: Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A: Statistical Mechanics and its Applications\u00a0374(1), 483\u2013490 (2007)","journal-title":"Physica A: Statistical Mechanics and its Applications"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40285-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:19:51Z","timestamp":1558030791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40285-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402845","9783642402852"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40285-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}