{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:19Z","timestamp":1772164039349,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T00:00:00Z","timestamp":1339372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,11]]},"DOI":"10.1145\/2254756.2254796","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T09:03:31Z","timestamp":1339405411000},"page":"331-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Clustered embedding of massive social networks"],"prefix":"10.1145","author":[{"given":"Han Hee","family":"Song","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berkant","family":"Savas","sequence":"additional","affiliation":[{"name":"Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tae Won","family":"Cho","sequence":"additional","affiliation":[{"name":"AT&T Labs, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vacha","family":"Dave","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengdong","family":"Lu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Qiu","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899055"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"e_1_3_2_1_3_1","unstructured":"Alexa global top 500 sites. http:\/\/www.alexa.com\/site\/ds\/top_sites.  Alexa global top 500 sites. http:\/\/www.alexa.com\/site\/ds\/top_sites."},{"key":"e_1_3_2_1_4_1","volume-title":"Evolution of the social network of scientific collaboration. Physica A: Statistical Mechanics and its Application","author":"Barabasi A. L.","year":"2002","unstructured":"A. L. Barabasi , H. Jeong , Z. N\u00e9da , E. Ravasz , A. Schubert , and T. Vicsek . Evolution of the social network of scientific collaboration. Physica A: Statistical Mechanics and its Application , 2002 . A. L. Barabasi, H. Jeong, Z. N\u00e9da, E. Ravasz, A. Schubert, and T. Vicsek. Evolution of the social network of scientific collaboration. Physica A: Statistical Mechanics and its Application, 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Statistical Computing and Statistical Graphics Newsletter","author":"Bell R. M.","year":"2007","unstructured":"R. M. Bell , Y. Koren , and C. Volinsky . Chasing \\$1,000,000: How we won the Netflix Progress Prize . Statistical Computing and Statistical Graphics Newsletter , 2007 . R. M. Bell, Y. Koren, and C. Volinsky. Chasing \\$1,000,000: How we won the Netflix Progress Prize. Statistical Computing and Statistical Graphics Newsletter, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2002-6302"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.128701"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of NSDI","author":"Garriss S.","year":"2006","unstructured":"S. Garriss , M. Kaminsky , M. J. Freedman , B. Karp , D. Mazieres , and H. Yu . RE: Reliable Email . In Proc. of NSDI , 2006 . S. Garriss, M. Kaminsky, M. J. Freedman, B. Karp, D. Mazieres, and H. Yu. RE: Reliable Email. In Proc. of NSDI, 2006."},{"key":"e_1_3_2_1_13_1","volume-title":"Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan . Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences . Johns Hopkins University Press , 1996 . G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/088342306000000222"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297332.1297336"},{"issue":"3","key":"e_1_3_2_1_18_1","first-page":"43","article-title":"Mapping networks of terrorist cells","volume":"24","author":"Krebs V.","year":"2002","unstructured":"V. Krebs . Mapping networks of terrorist cells . Connections , 24 ( 3 ): 43 -- 52 , Winter 2002 . V. Krebs. Mapping networks of terrorist cells. Connections, 24(3):43--52, Winter 2002.","journal-title":"Connections"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553447"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719628","volume-title":"Arpack Users' Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods","author":"Lehoucq R.","year":"1998","unstructured":"R. Lehoucq , D. Sorensen , and C. Yang . Arpack Users' Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods . SIAM , Philadelphia , 1998 . R. Lehoucq, D. Sorensen, and C. Yang. Arpack Users' Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia, 1998."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028827"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of HotNets-V","author":"Mislove A.","year":"2006","unstructured":"A. Mislove , K. P. Gummadi , and P. Druschel . Exploiting social networks for Internet search . In Proc. of HotNets-V , 2006 . A. Mislove, K. P. Gummadi, and P. Druschel. Exploiting social networks for Internet search. In Proc. of HotNets-V, 2006."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397742"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2007.71"},{"key":"e_1_3_2_1_31_1","volume-title":"INFOCOMM","author":"Ng T. E.","year":"2002","unstructured":"T. E. Ng and H. Zhang . Predicting internet network distance with coordinate-based appoaches . In INFOCOMM , 2002 . T. E. Ng and H. Zhang. Predicting internet network distance with coordinate-based appoaches. In INFOCOMM, 2002."},{"key":"e_1_3_2_1_32_1","volume-title":"Fastest growing social networks for","author":"Online Nielson","year":"2008","unstructured":"Nielson Online . Fastest growing social networks for September 2008 . http:\/\/blog.nielsen.com\/nielsenwire\/wp-content\/uploads\/2008\/10\/press_release24.pdf. Nielson Online. Fastest growing social networks for September 2008. http:\/\/blog.nielsen.com\/nielsenwire\/wp-content\/uploads\/2008\/10\/press_release24.pdf."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2006.38"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851227"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739332"},{"key":"e_1_3_2_1_36_1","volume-title":"NIPS","author":"Richardson M.","year":"2002","unstructured":"M. Richardson and P. Domingos . The intelligent surfer: Probabilistic combination of link and content information in pagerank . In NIPS , 2002 . M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS, 2002."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390269"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.15"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644932"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281272"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851226"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/645722.666392"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592600"}],"event":{"name":"SIGMETRICS '12: ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"London England, UK","acronym":"SIGMETRICS '12","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","IFIP International Federation for Information Processing"]},"container-title":["Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254796","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2254756.2254796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:20:50Z","timestamp":1750224050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,11]]},"references-count":44,"alternative-id":["10.1145\/2254756.2254796","10.1145\/2254756"],"URL":"https:\/\/doi.org\/10.1145\/2254756.2254796","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2318857.2254796","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,6,11]]},"assertion":[{"value":"2012-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}