{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T21:25:41Z","timestamp":1764192341783},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,3,3]],"date-time":"2009-03-03T00:00:00Z","timestamp":1236038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11280-009-0060-x","type":"journal-article","created":{"date-parts":[[2009,3,2]],"date-time":"2009-03-02T10:48:43Z","timestamp":1235990923000},"page":"235-261","source":"Crossref","is-referenced-by-count":39,"title":["Detecting Overlapping Community Structures in Networks"],"prefix":"10.1007","volume":"12","author":[{"given":"Fang","family":"Wei","sequence":"first","affiliation":[]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,3]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","volume":"22","author":"B. Adamcsek","year":"2006","unstructured":"Adamcsek, B., Palla, G., Farkas, I., Der\u00e9nyi, I., Vicsek, T.: CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22, 1021\u20131023 (2006)","journal-title":"Bioinformatics"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: Proceedings of the 15th International World Wide Web Conference, Edinburgh, 23\u201326 May 2006","DOI":"10.1145\/1135777.1135814"},{"key":"60_CR3","unstructured":"Baumes, J., Goldberg, M., Krishnamoorty, M., Magdon-Ismail, M., Preston, N.: Finding communities by clustering a graph into overlapping subgraphs. In: Proc. IADIS Applied Computing, pp. 97\u2013104, Algarve, 22\u201325 February 2005"},{"key":"60_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/11427995_3","volume-title":"Intelligence and Security Informatics (LNCS 3495)","author":"J. Baumes","year":"2005","unstructured":"Baumes, J., Goldberg, M., Krishnamoorty, M., Magdon-Ismail, M.: Efficient identification of overlapping communities. In: Intelligence and Security Informatics (LNCS 3495), pp. 27\u201336. Springer, New York (2005)"},{"key":"60_CR5","unstructured":"Brandes, U., Delling, D., Gaertler, M., Goerke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: Maximizing modularity is hard. Physics 0608255 (2006)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Burioni, R., Cassi, D.: Random walks on graphs: ideas techniques and results. J. Phys. A, Math. Gen. 38(8), Article R01, March (2005)","DOI":"10.1088\/0305-4470\/38\/8\/R01"},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of ICDM, pp. 107\u2013114, San Jose, 29 November\u20132 December 2001","DOI":"10.1109\/ICDM.2001.989507"},{"key":"60_CR8","doi-asserted-by":"crossref","first-page":"027104","DOI":"10.1103\/PhysRevE.72.027104","volume":"72","author":"J. Duch","year":"2005","unstructured":"Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72, 027104 (2005)","journal-title":"Phys. Rev. E"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Conductance and congestion in power law graphs. Sigmetrics 148\u2013159 (2003)","DOI":"10.1145\/885651.781046"},{"issue":"1","key":"60_CR10","doi-asserted-by":"crossref","first-page":"58C82","DOI":"10.1023\/B:WWWJ.0000015865.63749.b2","volume":"7","author":"G. Greco","year":"2004","unstructured":"Greco, G., Greco, S., Zumpano, E.: Web communities: models and algorithms. World Wide Web J. 7(1), 58C82 (2004)","journal-title":"World Wide Web J."},{"key":"60_CR11","first-page":"91","volume-title":"Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Sep.","author":"S. Gregory","year":"2007","unstructured":"Gregory, S.: An algorithm to find overlapping community structure in networks. In: Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Sep., pp. 91\u2013102. Springer, New York (2007)"},{"key":"60_CR12","unstructured":"Hou, J., Zhang, Y.: Constructing good quality web page communities. In: Proc. of Thirteenth Australasian Database Conference (ADC2002), Melbourne, January\u2013February 2002"},{"key":"60_CR13","unstructured":"Hou, J., Zhang, Y.: Utilizing hyperlink transitivity to improve web page clustering. In: Proceedings of the 14th Australasian Database Conference (ADC 2003), pp. 49\u201357, Adelaide, February 2003"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhu, T., Schuurmans, D.: Web communities identication from random walks. In: Joint European Conference on Machine Learning and European Conferenceon Principles and Practice of Knowledge Discovery in Databases (ECML\/PKDD-06), Berlin, 18\u201322 September 2006","DOI":"10.1007\/11871637_21"},{"key":"60_CR15","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1017\/S0963548306007504","volume":"15","author":"R. Kannan","year":"2006","unstructured":"Kannan, R., Lov\u00e1 sz, L., Montenegro, R.: Blocking conductance and mixing in random walks. Comb. Probab. Comput. 15, 541\u2013570 (2006)","journal-title":"Comb. Probab. Comput."},{"key":"60_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"60_CR17","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Combinatorics, Paul Erd\u00f6s is eighty, vol. 2 (Keszthely, 1993), pp. 353\u2013397, Bolyai Soc. Math. Stud. 2, J\u00e1nos Bolyai Math. Soc., Budapest (1996)"},{"key":"60_CR18","unstructured":"Montenegro, R., Tetali, P.: Mathematical aspects of mixing times in markov chains. Found. Trends Theor. Comp. Sci. 1 (2006). doi: http:\/\/10.1561\/0400000003"},{"key":"60_CR19","first-page":"026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. 69, 026113 (2004)","journal-title":"Phys. Rev."},{"key":"60_CR20","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"60_CR21","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. U. S. A. 103, 8577 (2006)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"60_CR22","first-page":"849","volume":"14","author":"A. Ng","year":"2002","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 14, 849\u2013856 (2002)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"60_CR23","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814\u2013818 (2005)","journal-title":"Nature"},{"key":"60_CR24","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"60_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s11280-007-0027-8","volume":"11","author":"A. Sidiropoulos","year":"2008","unstructured":"Sidiropoulos, A., Pallis, G., Katsaros, D., Stamos, K., Vakali, A., Manolopoulos, Y.: Prefetching in content distribution networks via web communities identification and outsourcing. World Wide Web J. 11(1), 39\u201370 (2008)","journal-title":"World Wide Web J."},{"key":"60_CR26","volume-title":"Social Network Analysis: a Handbook","author":"J. Scott","year":"2000","unstructured":"Scott, J.: Social Network Analysis: a Handbook, 2nd edn. Sage, London (2000)","edition":"2"},{"issue":"2\u20133","key":"60_CR27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H.D. Simon","year":"1991","unstructured":"Simon, H.D.: Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 2(2\u20133), 135\u2013148 (1991)","journal-title":"Comput. Syst. Eng."},{"key":"60_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1007352.1007372","volume-title":"ACM STOC-04","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: ACM STOC-04, pp. 81\u201390. ACM, New York (2004)"},{"key":"60_CR29","unstructured":"Wei, F., Wang, C., Ma, L., Zhou, A.: Detecting Overlapping Community Structures in Networks with Global Partition and Local Expansion. APWeb, LNCS 4976 (2008)"},{"key":"60_CR30","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: SIAM International Conference on Data Mining, Newport Beach, 21\u201323 April 2005","DOI":"10.1137\/1.9781611972757.25"},{"issue":"1","key":"60_CR31","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.physa.2006.07.023","volume":"374","author":"SH Zhang","year":"2007","unstructured":"Zhang SH, Wang RS, Zhang XS: Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys. A-Stat. mech. Appl. 374(1), 483\u2013490, Jan. 15 (2007)","journal-title":"Phys. A-Stat. mech. Appl."},{"key":"60_CR32","volume-title":"Web Communities: Analysis and Construction","author":"Y. Zhang","year":"2006","unstructured":"Zhang, Y., Yu, J.X., Hou, J.: Web Communities: Analysis and Construction. Springer, Berlin Heidelberg New York (2006)"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-009-0060-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-009-0060-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-009-0060-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:18:39Z","timestamp":1559395119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-009-0060-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,3]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s11280-009-0060-x","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,3]]}}}