{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:29:29Z","timestamp":1773098969079,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T00:00:00Z","timestamp":1359936000000},"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":[[2013,2,4]]},"DOI":"10.1145\/2433396.2433457","type":"proceedings-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T13:19:52Z","timestamp":1360070392000},"page":"495-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":174,"title":["What's in a name?"],"prefix":"10.1145","author":[{"given":"Jing","family":"Liu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinying","family":"Song","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-In","family":"Song","sequence":"additional","affiliation":[{"name":"NHN Corporation, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Yew","family":"Lin","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsiao-Wuen","family":"Hon","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13470-8_4"},{"key":"e_1_3_2_1_2_1","volume-title":"The treatment of missing values and its effect on classifier accuracy. Classification, Clustering, and Data Mining Applications","author":"Acuna E.","year":"2004","unstructured":"E. Acuna and C. Rodriguez . The treatment of missing values and its effect on classifier accuracy. Classification, Clustering, and Data Mining Applications , 2004 . E. Acuna and C. Rodriguez. The treatment of missing values and its effect on classifier accuracy. Classification, Clustering, and Data Mining Applications, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1613715.1613756"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217304"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of COLING","author":"Cai J.","year":"2010","unstructured":"J. Cai and M. Strube . End-to-end coreference resolution via hypergraph partitioning . In Proceedings of COLING , 2010 . J. Cai and M. Strube. End-to-end coreference resolution via hypergraph partitioning. In Proceedings of COLING, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148267"},{"key":"e_1_3_2_1_11_1","volume-title":"Digital image processing","author":"Gonzalez R.","year":"2002","unstructured":"R. Gonzalez and R. Woods . Digital image processing . 2002 . R. Gonzalez and R. Woods. Digital image processing. 2002."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of ICWSM","author":"Iofciu T.","year":"2011","unstructured":"T. Iofciu , P. Fankhauser , F. Abel , and K. Bischoff . Identifying users across social tagging systems . In Proceedings of ICWSM , 2011 . T. Iofciu, P. Fankhauser, F. Abel, and K. Bischoff. Identifying users across social tagging systems. In Proceedings of ICWSM, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.78"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of AAAI","author":"Kumar S.","year":"2011","unstructured":"S. Kumar , R. Zafarani , and H. Liu . Understanding user migration patterns in social media . In Proceedings of AAAI , 2011 . S. Kumar, R. Zafarani, and H. Liu. Understanding user migration patterns in social media. In Proceedings of AAAI, 2011."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of SNAKDD","author":"Labitzke S.","year":"2011","unstructured":"S. Labitzke , I. Taranu , and H. Hartenstein . What your friends tell others about you: Low cost linkability of social network profiles . In Proceedings of SNAKDD , 2011 . S. Labitzke, I. Taranu, and H. Hartenstein. What your friends tell others about you: Low cost linkability of social network profiles. In Proceedings of SNAKDD, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398647"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009975"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.184"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743546.1743558"},{"key":"e_1_3_2_1_23_1","volume-title":"modules and large-scale structure in networks. Nature Physics, 8(1)","author":"Newman M.","year":"2011","unstructured":"M. Newman . Communities , modules and large-scale structure in networks. Nature Physics, 8(1) , 2011 . M. Newman. Communities, modules and large-scale structure in networks. Nature Physics, 8(1), 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988678"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2245413"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063756"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of USENIX","author":"Rao J.","year":"2000","unstructured":"J. Rao and P. Rohatgi . Can pseudonymity really guarantee privacy . In Proceedings of USENIX , 2000 . J. Rao and P. Rohatgi. Can pseudonymity really guarantee privacy. In Proceedings of USENIX, 2000."},{"key":"e_1_3_2_1_28_1","volume-title":"A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4)","author":"Soon W.","year":"2001","unstructured":"W. Soon , H. Ng , and D. Lim . A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4) , 2001 . W. Soon, H. Ng, and D. Lim. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4), 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/NDT.2009.5272173"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963457"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of NAACL","author":"Wang K.","year":"2010","unstructured":"K. Wang , C. Thrasher , E. Viegas , X. Li , and B. Hsu . An overview of microsoft web n-gram corpus and applications . In Proceedings of NAACL , 2010 . K. Wang, C. Thrasher, E. Viegas, X. Li, and B. Hsu. An overview of microsoft web n-gram corpus and applications. In Proceedings of NAACL, 2010."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718520"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of ICWSM","author":"Zafarani R.","year":"2009","unstructured":"R. Zafarani and H. Liu . Connecting corresponding identities across communities . In Proceedings of ICWSM , 2009 . R. Zafarani and H. Liu. Connecting corresponding identities across communities. In Proceedings of ICWSM, 2009."}],"event":{"name":"WSDM 2013: Sixth ACM International Conference on Web Search and Data Mining","location":"Rome Italy","acronym":"WSDM 2013","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the sixth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433457","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2433396.2433457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:39Z","timestamp":1750235739000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2433396.2433457"}},"subtitle":["an unsupervised approach to link users across communities"],"short-title":[],"issued":{"date-parts":[[2013,2,4]]},"references-count":33,"alternative-id":["10.1145\/2433396.2433457","10.1145\/2433396"],"URL":"https:\/\/doi.org\/10.1145\/2433396.2433457","relation":{},"subject":[],"published":{"date-parts":[[2013,2,4]]},"assertion":[{"value":"2013-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}