{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:52:24Z","timestamp":1742997144167,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176159"},{"type":"electronic","value":"9783642176166"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17616-6_9","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T03:20:57Z","timestamp":1293592857000},"page":"77-90","source":"Crossref","is-referenced-by-count":4,"title":["Refining Graph Partitioning for Social Network Clustering"],"prefix":"10.1007","author":[{"given":"Tieyun","family":"Qian","sequence":"first","affiliation":[]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Bui, T., Jones, C.: A heuristic for reducing fill in sparse matrix factorization. In: 6th SIAM Conf. Parallel Processing for Scientific Computing, pp. 445\u2013452 (1993)"},{"key":"9_CR2","unstructured":"Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. In: Proc. of CVPR, pp. 731\u2013737 (1997)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","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 Journal on Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","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\u00a046(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"9_CR5","first-page":"849","volume-title":"Advances in Neural Information Processing Systems","author":"A. Ng","year":"2001","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol.\u00a014, pp. 849\u2013856. MIT Press, Cambridge (2001)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E\u00a069 art. (066133) (2004)","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Guimer\u00e0, R., Sales-Pardo, M., Amaral, L.A.N.: Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E\u00a070(2), 025101 (R) (2004)","DOI":"10.1103\/PhysRevE.70.025101"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: Proc. of SIAM International Conference on Data Mining, pp. 76\u201384 (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"9_CR9","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":"9_CR10","doi-asserted-by":"crossref","unstructured":"Abou-rjeili, A., Karypis, G.: Multilevel Algorithms for Partitioning Power-Law Graphs. Technical Report, TR 05-034 (2005)","DOI":"10.21236\/ADA439402"},{"key":"9_CR11","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":"2","key":"9_CR12","doi-asserted-by":"publisher","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. The Bell System Technical Journal\u00a049(2), 291\u2013307 (1970)","journal-title":"The Bell System Technical Journal"},{"key":"9_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":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning. Springer, Berlin (2001)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Massen, C.P., Doye, J.P.K.: Identifying communities within energy landscapes. Phys. Rev. E\u00a071(4), 46101 (2005)","DOI":"10.1103\/PhysRevE.71.046101"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.physa.2005.04.022","volume":"358","author":"A. Medus","year":"2005","unstructured":"Medus, A., Acu\u00f1a, G., Dorso, C.O.: Detection of community structures in networks via global optimization. Physica A\u00a0358, 593\u2013604 (2005)","journal-title":"Physica A"},{"key":"9_CR17","unstructured":"Tasgin, M., Herdagdelen, A., Bingol, H.: Community detection in complex networks using genetic algorithms, eprint arXiv: 0711.0491"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"27104","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\u00a072(2), 27104 (2005)","journal-title":"Phys. Rev. E"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: From the cover: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA\u00a0103, 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., et al.: A min-max cut algorithm for graph partitioning and data clustering. In: Proc. of ICDM, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"9_CR21","first-page":"298","volume-title":"Proc. of Intl. Conf. on Computer Aided Design","author":"Y.-C. Wei","year":"1989","unstructured":"Wei, Y.-C., Cheng, C.-K.: Towards efficient hierarchical designs by ratio cut partitioning. In: Proc. of Intl. Conf. on Computer Aided Design, pp. 298\u2013301. Institute of Electrical and Electronics Engineers, New York (1989)"},{"key":"9_CR22","doi-asserted-by":"publisher","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. Information Retrieval Journal\u00a03, 127\u2013163 (2000)","journal-title":"Information Retrieval Journal"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph Evolution: densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (ACM TKDD)\u00a01(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M. Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust Management for the Semantic Web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol.\u00a02870, pp. 351\u2013368. Springer, Heidelberg (2003)"},{"issue":"11","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"I. Dhillon","year":"2007","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors: a multilevel approach. IEEE. Transactions on PAMI\u00a029(11), 1944\u20131957 (2007)","journal-title":"IEEE. Transactions on PAMI"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17616-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T06:40:41Z","timestamp":1559889641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17616-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176159","9783642176166"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17616-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}