{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T10:13:14Z","timestamp":1709460794421},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s11390-008-9163-6","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T22:26:42Z","timestamp":1218061602000},"page":"672-683","source":"Crossref","is-referenced-by-count":18,"title":["Community Detection in Complex Networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Nan","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"9163_CR1","doi-asserted-by":"crossref","unstructured":"Watts D J, Strogatz S H. Collective dynamics of \u201csmall-world\u201d networks. Nature, 393(6684): 440\u2013442.","DOI":"10.1038\/30918"},{"key":"9163_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9780691188331","volume-title":"Small Worlds: The Dynamics of Networks Between Order and Randomness","author":"D J Watts","year":"1999","unstructured":"Watts D J. Small Worlds: The Dynamics of Networks Between Order and Randomness. Levin S A, Strogatz S H (eds.), Princeton: Princeton University Press, 1999."},{"key":"9163_CR3","doi-asserted-by":"crossref","unstructured":"Boccaletti S, Latora V, Moreno Y. Complex networks: Structure and dynamics. Physics Reports, 424(4\/5): 175\u2013308.","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"9163_CR4","doi-asserted-by":"crossref","unstructured":"Newman M E J. The structure and function of complex networks. SIAM Review, 45(2): 167\u2013256.","DOI":"10.1137\/S003614450342480"},{"key":"9163_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K. Social Network Analysis. Cambridge: Cambridge University Press, 1994."},{"key":"9163_CR6","volume-title":"Social Network Analysis: A Handbook","author":"J Scott","year":"2002","unstructured":"Scott J. Social Network Analysis: A Handbook. London: Sage Publications, 2002."},{"key":"9163_CR7","doi-asserted-by":"crossref","unstructured":"Milo R, Itzkovitz S et al. Network motifs: Simple building blocks of complex networks. Science, 298(5594): 824\u2013827.","DOI":"10.1126\/science.298.5594.824"},{"key":"9163_CR8","doi-asserted-by":"crossref","unstructured":"Newman M E J. Modularity and community structure in networks. PNAS, 103(23): 8577.","DOI":"10.1073\/pnas.0601602103"},{"key":"9163_CR9","doi-asserted-by":"crossref","unstructured":"Girvan M, Newman M E J. Community structure in social and biological networks. PNAS, 99(12): 7821\u20137826.","DOI":"10.1073\/pnas.122653799"},{"key":"9163_CR10","doi-asserted-by":"crossref","unstructured":"Duch J, Arenas A. Community detection in complex networks using extremal optimization. Physical Review E, 72(2): 027104.","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"9163_CR11","doi-asserted-by":"crossref","unstructured":"Palla G, Dernyi I, Farkas I. Uncovering the overlapping community structure of complex network in nature and society. Nature, 435(7043): 814\u2013818.","DOI":"10.1038\/nature03607"},{"key":"9163_CR12","doi-asserted-by":"crossref","unstructured":"Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(98): 298\u2013305.","DOI":"10.21136\/CMJ.1973.101168"},{"key":"9163_CR13","doi-asserted-by":"crossref","unstructured":"Pothen A, Simon H, Liou K-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal App., 11(33): 430\u2013452.","DOI":"10.1137\/0611030"},{"key":"9163_CR14","doi-asserted-by":"crossref","unstructured":"Kernighan B W, Lin S. A efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2): 291\u2013307.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"9163_CR15","doi-asserted-by":"crossref","unstructured":"Newman M E J. Detecting community structure in networks. Eur. Phys. J. B, 38(2): 321\u2013330.","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"9163_CR16","doi-asserted-by":"crossref","unstructured":"Bron C, Kerbosch J. Finding all cliques of an undirected graph. Communications of the ACM , 16(9): 575\u2013577.","DOI":"10.1145\/362342.362367"},{"key":"9163_CR17","doi-asserted-by":"crossref","unstructured":"Du N, Wu B, Wang B et al. A parallel algorithm for enumerating all maximal cliques in complex networks. In Proc. The 6th ICDM2006 Workshop, Hong Kong, 2006, pp.320\u2013324.","DOI":"10.1109\/ICDMW.2006.17"},{"key":"9163_CR18","doi-asserted-by":"crossref","unstructured":"Wu B, Pei X et al. A parallel algorithm for enumerating all the maximal k-plexes. In Proc. PAKDD07 Workshops, Nanjing, 2007, pp.476\u2013483.","DOI":"10.1007\/978-3-540-77018-3_47"},{"key":"9163_CR19","doi-asserted-by":"crossref","unstructured":"Abello J, Resende M G C, Sudarsky S et al. Massive quasiclique detection. In Proc. the 5th Latin American Symposium on Theoretical Informatics, Mexico, 2002, pp.598\u2013612.","DOI":"10.1007\/3-540-45995-2_51"},{"key":"9163_CR20","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D X, Zhang A D et al. On mining cross-graph quasi-cliques. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.228\u2013237.","DOI":"10.1145\/1081870.1081898"},{"key":"9163_CR21","doi-asserted-by":"crossref","unstructured":"Zeng Z, Wang J, Karypis G et al. Coherent closed quasiclique discovery from large dense graph databases. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.797\u2013802.","DOI":"10.1145\/1150402.1150506"},{"key":"9163_CR22","unstructured":"Han J W, Kamber M. Data Mining: Concepts and Techniques. 2nd Edition, Morgan Kaufmann Publishers, 2006."},{"key":"9163_CR23","unstructured":"Luca Donetti, Miguel A. Munoz detecting network communities: A new systematic and efficient algorithm. Electric Journal of Statistical Mechanics, doi 10.1088\/1742-5468\/2004\/10\/P10012 , http:\/\/www.iop.org\/EJ\/abstract\/1742-5468\/2004\/10\/P10012 ."},{"key":"9163_CR24","doi-asserted-by":"crossref","unstructured":"Girvan M, Newman M E J. Finding and evaluating community structure in networks. Physical Review E, 69(2): 026113.","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"9163_CR25","doi-asserted-by":"crossref","unstructured":"Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D. Defining and identifying communities in networks. PNAS, 101(9): 2658\u20132663.","DOI":"10.1073\/pnas.0400054101"},{"key":"9163_CR26","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman M E J, Moore C. Finding community structure in very large networks. Physical Review E, 70(6): 066111.","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"9163_CR27","doi-asserted-by":"crossref","unstructured":"Pons P, Latapy M. Computing communities in large networks using random walks. In Proc. ISCIS2005, Istanbul, 2005, pp.284\u2013293.","DOI":"10.1007\/11569596_31"},{"key":"9163_CR28","doi-asserted-by":"crossref","unstructured":"Clauset A. Finding local community structure in networks. Physical Review E, 72(2): 026132.","DOI":"10.1103\/PhysRevE.72.026132"},{"key":"9163_CR29","doi-asserted-by":"crossref","unstructured":"Yang B, Liu D Y. Force-based incremental algorithm for mining community structure in dynamic network. Journal of Computer Science and Technology, 21(3): 393\u2013400.","DOI":"10.1007\/s11390-006-0393-1"},{"key":"9163_CR30","unstructured":"Gunes I, Bingol H. Community detection in complex networks using agents. Cornell University Library e-prints, arXiv:cs\/0610129v1, http:\/\/arxiv.org\/abs\/cs\/0610129v1 ."},{"issue":"1","key":"9163_CR31","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M. Resolution limit in community detection. PNAS, 2007, 104(1): 36\u201341.","journal-title":"PNAS"},{"key":"9163_CR32","unstructured":"http:\/\/w3.usf.edu\/FreeAssociation\/ ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9163-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-008-9163-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9163-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T13:31:41Z","timestamp":1684503101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-008-9163-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9163"],"URL":"https:\/\/doi.org\/10.1007\/s11390-008-9163-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}