{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:10:35Z","timestamp":1743037835068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319399362"},{"type":"electronic","value":"9783319399379"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39937-9_27","type":"book-chapter","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T09:00:15Z","timestamp":1464339615000},"page":"353-364","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Partitioning for Multiple Social Networks with Anchor Nodes"],"prefix":"10.1007","author":[{"given":"Fenglan","family":"Li","sequence":"first","affiliation":[]},{"given":"Anming","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Songchang","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Shuqiang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,28]]},"reference":[{"unstructured":"Zhang, J., Yu, P.S.: MCD: Mutual clustering across multiple heterogeneous networks. In: IEEE BigData Congress (2015)","key":"27_CR1"},{"unstructured":"Zhang, J., Yu, P.S.: Mutual community detection across multiple partially aligned social networks. arXiv preprint arXiv:1506.05529 (2015)","key":"27_CR2"},{"unstructured":"Zhang, J., Philip, S.Y.: Integrated anchor and social link predictions across social networks. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 2125\u20132131. AAAI Press (2015)","key":"27_CR3"},{"doi-asserted-by":"crossref","unstructured":"Liu, G., Zhang, M., Yan, F.: Large-scale social network analysis based on mapreduce. In: 2010 International Conference on Computational Aspects of Social Networks (CASoN), pp. 487\u2013490. IEEE (2010)","key":"27_CR4","DOI":"10.1109\/CASoN.2010.115"},{"unstructured":"Gong, N.: Using map-reduce for large scale analysis of graph-based data (2011)","key":"27_CR5"},{"doi-asserted-by":"crossref","unstructured":"Jin, S., Yu, P.S., Li, S., Yang, S.: A parallel community structure mining method in big social networks. Math. Prob. Eng. 2015 (2015)","key":"27_CR6","DOI":"10.1155\/2015\/934301"},{"doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 464\u2013472. ACM (1999)","key":"27_CR7","DOI":"10.1145\/301250.301373"},{"unstructured":"Golberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)","key":"27_CR8"},{"issue":"4598","key":"27_CR9","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., et al.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"27_CR10","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."},{"doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Conference on Design Automation, pp. 175\u2013181. IEEE (1982)","key":"27_CR11","DOI":"10.1109\/DAC.1982.1585498"},{"doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, p. 28. ACM (1995)","key":"27_CR12","DOI":"10.1145\/224170.224228"},{"issue":"3","key":"27_CR13","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: ICPP (3), pp. 113\u2013122 (1995)","key":"27_CR14","DOI":"10.1145\/224170.224229"},{"issue":"5","key":"27_CR15","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TC.1987.1676942","volume":"100","author":"MJ Berger","year":"1987","unstructured":"Berger, M.J., Bokhari, S.H.: A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comput. 100(5), 570\u2013580 (1987)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"27_CR16","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1002\/nme.1620360503","volume":"36","author":"C Farhat","year":"1993","unstructured":"Farhat, C., Lesoinne, M.: Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. Int. J. Numer. Meth. Eng. 36(5), 745\u2013764 (1993)","journal-title":"Int. J. Numer. Meth. Eng."},{"unstructured":"Smith, C.: The planet\u2019s 24 largest social media sites, and where their next wave of growth will come from. Business Insider 8 (2013)","key":"27_CR17"},{"unstructured":"Bui, T.N., Jones, C.: A heuristic for reducing fill-in in sparse matrix factorization. Technical report, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (United States) (1993)","key":"27_CR18"},{"issue":"12","key":"27_CR19","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"CK Cheng","year":"1991","unstructured":"Cheng, C.K., Wei, Y.C., et al.: An improved two-way partitioning algorithm with stable performance [VLSI]. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 10(12), 1502\u20131511 (1991)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"doi-asserted-by":"crossref","unstructured":"Garbers, J., Promel, H.J., Steger, A.: Finding clusters in VLSI circuits. In: 1990 IEEE International Conference on Computer-Aided Design, ICCAD 1990. Digest of Technical Papers, pp. 520\u2013523. IEEE (1990)","key":"27_CR20","DOI":"10.1109\/ICCAD.1990.129970"},{"doi-asserted-by":"crossref","unstructured":"Hagen, L., Kahng, A.B.: A new approach to effective circuit clustering. In: 1992 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 1992. Digest of Technical Papers, pp. 422\u2013427. IEEE (1992)","key":"27_CR21","DOI":"10.1109\/ICCAD.1992.279334"},{"doi-asserted-by":"crossref","unstructured":"Jin, S., Zhang, J., Yu, P.S., Yang, S., Li, A.: Synergistic partitioning in multiple large scale social networks. In: 2014 IEEE International Conference on Big Data (Big Data), pp. 281\u2013290. IEEE (2014)","key":"27_CR22","DOI":"10.1109\/BigData.2014.7004243"},{"issue":"1","key":"27_CR23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"27_CR24","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev. 41(2), 278\u2013300 (1999)","journal-title":"SIAM Rev."},{"issue":"1","key":"27_CR25","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 high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"27_CR26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0031-3203(98)00091-0","volume":"32","author":"C Studholme","year":"1999","unstructured":"Studholme, C., Hill, D.L., Hawkes, D.J.: An overlap invariant entropy measure of 3d medical image alignment. Pattern Recogn. 32(1), 71\u201386 (1999)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39937-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T19:04:49Z","timestamp":1656615889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39937-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319399362","9783319399379"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39937-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}