{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:26:37Z","timestamp":1745987197699,"version":"3.40.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,29]],"date-time":"2013-03-29T00:00:00Z","timestamp":1364515200000},"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":[[2014,5]]},"DOI":"10.1007\/s11280-013-0209-5","type":"journal-article","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T03:09:00Z","timestamp":1364440140000},"page":"405-425","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting small world property for network clustering"],"prefix":"10.1007","volume":"17","author":[{"given":"Tieyun","family":"Qian","sequence":"first","affiliation":[]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jaideep","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,29]]},"reference":[{"key":"209_CR1","doi-asserted-by":"crossref","unstructured":"Abou-rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: Technical Report TR 05-034 (2005)","DOI":"10.21236\/ADA439402"},{"issue":"3","key":"209_CR2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","volume":"66","author":"G Agarwal","year":"2008","unstructured":"Agarwal, G., Kempe, D.: Modularity-maximizing network communities via mathematical programming. Eur. Phys. J. B 66(3), 409\u2013418 (2008)","journal-title":"Eur. Phys. J. B"},{"issue":"21","key":"209_CR3","doi-asserted-by":"crossref","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"LAN Amaral","year":"2000","unstructured":"Amaral, L.A.N., Scala, A., Barth\u00e9l\u00e9my, M., Stanley, H.E.: Classes of small-world networks. PNAS 97(21), 11149\u201311152 (2000)","journal-title":"PNAS"},{"key":"209_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Proc. of WAW (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"issue":"2","key":"209_CR5","first-page":"172","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00d6rke R.M. Hoefer, Z.N., Wagner, D.: On modularity clustering. TKDE 20(2), 172\u2013188 (2008)","journal-title":"TKDE"},{"key":"209_CR6","unstructured":"Bui, T., Jones., C.: A heuristic for reducing fill in sparse matrix factorization. In: Proc. of 6th SIAM Conf. Parallel Processing for Scientific Computing, pp. 445\u2013452 (1993)"},{"issue":"2","key":"209_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0020-0190(00)00118-6","volume":"76","author":"F Comellas","year":"2000","unstructured":"Comellas, F., Oz\u00f3n, J., Peters, J.G.: Deterministic small-world communication networks. Inf. Process. Lett. 76(2), 83\u201390 (2000)","journal-title":"Inf. Process. Lett."},{"key":"209_CR8","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.physa.2005.04.022","volume":"358","author":"A Medus","year":"2005","unstructured":"Medus, A., Acu\u00d1a, G., Dorso, C.O.: Detection of community structures in networks via global optimization. Physica A 358, 593\u2013604 (2005)","journal-title":"Physica A"},{"key":"209_CR9","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: Kernel k-means, spectral clustering and normalized cuts. In: Prof. the 10th SIGKDD (2004)","DOI":"10.1145\/1014052.1014118"},{"key":"209_CR10","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: Proc. of WWW (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"209_CR11","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: Proc. of WWW (2007)","DOI":"10.1145\/1242572.1242635"},{"issue":"2","key":"209_CR12","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(2), 027104 (2005)","journal-title":"Phys. Rev. E"},{"key":"209_CR13","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. In: Proc. 19th IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"209_CR14","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proc. of SIGKDD. (2000)","DOI":"10.1145\/347090.347121"},{"key":"209_CR15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Forunato","year":"2010","unstructured":"Forunato, S.: Community detection in graphs. Phys. Rep. 486, 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"209_CR16","doi-asserted-by":"crossref","unstructured":"Hauck, S., Borriello, G.: An evaluation of bipartitioning technique. In: Proc. Chapel Hill Conference on Advanced Research in VLSI (1995)","DOI":"10.1109\/ARVLSI.1995.515634"},{"issue":"1","key":"209_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"209_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"209_CR19","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Proc. of ICALP (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"209_CR20","doi-asserted-by":"crossref","unstructured":"Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: a kernel approach. In: Proc. of 22nd ICML (2005)","DOI":"10.1145\/1102351.1102409"},{"key":"209_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0378-4371(02)01089-0","volume":"314","author":"V Latora","year":"2002","unstructured":"Latora, V., Marchiori, M.: Bs the Boston subway a small-world network? Physica A 314, 109\u2013113 (2002)","journal-title":"Physica A"},{"key":"209_CR22","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(016118) (2009)","DOI":"10.1103\/PhysRevE.80.016118"},{"issue":"6","key":"209_CR23","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"F Leighton","year":"1999","unstructured":"Leighton, F., Rao, S.: Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"209_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proc. of SIGKDD (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"209_CR25","doi-asserted-by":"crossref","first-page":"Article 2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), Article 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"209_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.W.: Empirical comparison of algorithms for network community detection. In: Proc. of WWW (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"209_CR27","unstructured":"Mardia, K.: Multivariate Analysis. Academic Press (1979)"},{"key":"209_CR28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"A McCallum","year":"2000","unstructured":"McCallum, A., Nigam, K., Rennie, J., Seymore, K.: Automating the construction of internet portals with machine learning. Inf. Retr. J. 3, 127\u2013163 (2000)","journal-title":"Inf. Retr. J."},{"issue":"3","key":"209_CR29","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1006\/jtbi.2001.2460","volume":"214","author":"JM Montoya","year":"2002","unstructured":"Montoya, J.M., Sol\u00e9, R.V.: Small world patterns in food webs. J. Theor. Biol. 214(3), 405\u2013412 (2002)","journal-title":"J. Theor. Biol."},{"key":"209_CR30","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.physa.2005.04.022","volume":"358","author":"A Medus","year":"2005","unstructured":"Medus, A., Acu\u00d1a, G., Dorso, C.: Detection of community structures in networks via global optimization. Physica A 358, 593\u2013604 (2005)","journal-title":"Physica A"},{"key":"209_CR31","first-page":"66","volume":"E69","author":"M Newman","year":"2004","unstructured":"Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E69, 066\u2013133 (2004)","journal-title":"Phys. Rev."},{"key":"209_CR32","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M Newman","year":"2006","unstructured":"Newman, M.: From the cover: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103, 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"209_CR33","first-page":"849","volume":"14","author":"A Ng","year":"2001","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 14, 849\u2013856 (2001)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"209_CR34","doi-asserted-by":"crossref","unstructured":"Ralitsa, A., Gerhard, W.: Graph-based text classification: learn from your neighbors. In: Proc. of the 29th SIGIR, pp. 485\u2013492 (2006)","DOI":"10.1145\/1148170.1148254"},{"key":"209_CR35","first-page":"351","volume":"2870","author":"M Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. LNCS 2870, 351\u2013368 (2003)","journal-title":"LNCS"},{"issue":"1","key":"209_CR36","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S Schaeffer","year":"2007","unstructured":"Schaeffer, S.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"key":"209_CR37","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. In: Proc. of CVPR., pp. 731\u2013737 (1997)"},{"issue":"8","key":"209_CR38","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1093\/bioinformatics\/bti167","volume":"21","author":"Ad Sol","year":"2005","unstructured":"Sol, A.d., Fujihashi, H., O\u2019Meara, P.: Topology of small-world networks of protein-protein complex structures. Bioinformatics 21(8), pp. 1311\u20131315 (2005)","journal-title":"Bioinformatics"},{"key":"209_CR39","doi-asserted-by":"crossref","unstructured":"Tang, L., Wang, X., Liu, H.: Uncovering groups via heterogeneous interaction analysis. In: Proc. of ICDM, pp. 503\u2013512 (2009)","DOI":"10.1109\/ICDM.2009.20"},{"key":"209_CR40","unstructured":"Tasgin, M., Herdagdelen, A., Bingol, H.: Community detection in complex networks using genetic algorithms. arXiv: cond-mat\/0604419v1 (2006)"},{"key":"209_CR41","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2019small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"209_CR42","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s11280-009-0060-x","volume":"12","author":"F Wei","year":"2009","unstructured":"Wei, F., Qian, W., Wang, C., Zhou, A.: Detecting overlapping community structures in networks. World Wide Web J. 12, 235\u2013261 (2009)","journal-title":"World Wide Web J."},{"key":"209_CR43","author":"S Zhang","year":"2012","unstructured":"Zhang, S., Luo, X., Xuan, J., Chen, X., Xu, X.: Discovering small-world in association link networks for association learning. World Wide Web J. (2012). doi: 10.1007\/s11280-012-0171-7","journal-title":"World Wide Web J."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0209-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-013-0209-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0209-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T02:23:33Z","timestamp":1745979813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-013-0209-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,29]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["209"],"URL":"https:\/\/doi.org\/10.1007\/s11280-013-0209-5","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2013,3,29]]}}}