{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T16:52:23Z","timestamp":1784911943276,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T00:00:00Z","timestamp":1297209600000},"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":[[2011,2,9]]},"DOI":"10.1145\/1935826.1935903","type":"proceedings-article","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T15:50:27Z","timestamp":1296575427000},"page":"535-544","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Efficient entity resolution for large heterogeneous information spaces"],"prefix":"10.1145","author":[{"given":"George","family":"Papadakis","sequence":"first","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ekaterini","family":"Ioannou","sequence":"additional","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudia","family":"Nieder\u00e9e","sequence":"additional","affiliation":[{"name":"L3S Research Center, Hannover, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Fankhauser","sequence":"additional","affiliation":[{"name":"Fraunhofer IPSI, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1105926.1106227"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.13"},{"key":"e_1_3_2_1_3_1","volume-title":"IIWeb","author":"Cohen W. W.","year":"2003","unstructured":"W. W. Cohen , P. D. Ravikumar , and S. E. Fienberg . A comparison of string distance metrics for name-matching tasks . In IIWeb , 2003 . W. W. Cohen, P. D. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IIWeb, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645994"},{"key":"e_1_3_2_1_5_1","article-title":"Semantic integration research in the database community: A brief survey","author":"Doan A.","year":"2005","unstructured":"A. Doan and A. Y. Halevy . Semantic integration research in the database community: A brief survey . AI Magazine , 2005 . A. Doan and A. Y. Halevy. Semantic integration research in the database community: A brief survey. AI Magazine, 2005.","journal-title":"AI Magazine"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066168"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117456"},{"key":"e_1_3_2_1_9_1","first-page":"491","volume-title":"VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In VLDB , pages 491 -- 500 , 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491--500, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142352"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69534-9_41"},{"key":"e_1_3_2_1_13_1","volume-title":"DASFAA","author":"Jin L.","year":"2003","unstructured":"L. Jin , C. Li , and S. Mehrotra . Efficient record linkage in large data sets . In DASFAA , 2003 . L. Jin, C. Li, and S. Mehrotra. Efficient record linkage in large data sets. In DASFAA, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138394.1138401"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_3_2_1_16_1","first-page":"342","volume-title":"CIDR","author":"Madhavan J.","year":"2007","unstructured":"J. Madhavan , S. Cohen , X. L. Dong , A. Y. Halevy , S. R. Jeffery , D. Ko , and C. Yu . Web-scale data integration: You can afford to pay as you go . In CIDR , pages 342 -- 350 , 2007 . J. Madhavan, S. Cohen, X. L. Dong, A. Y. Halevy, S. R. Jeffery, D. Ko, and C. Yu. Web-scale data integration: You can afford to pay as you go. In CIDR, pages 342--350, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_3_2_1_18_1","volume-title":"AAAI","author":"Michelson M.","year":"2006","unstructured":"M. Michelson and C. A. Knoblock . Learning blocking schemes for record linkage . In AAAI , 2006 . M. Michelson and C. A. Knoblock. Learning blocking schemes for record linkage. In AAAI, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369026"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367895"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775099"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559870"},{"key":"e_1_3_2_1_23_1","volume-title":"Statistical Research Division","author":"Winkler W.","year":"2006","unstructured":"W. Winkler . Overview of record linkage and current research directions. Technical report , Statistical Research Division , U.S. Bureau of the Census, 2006 . W. Winkler. Overview of record linkage and current research directions. Technical report, Statistical Research Division, U.S. Bureau of the Census, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IRI.2008.4583065"}],"event":{"name":"WSDM'11: Fourth ACM International Conference on Web Search and Data Mining","location":"Hong Kong China","acronym":"WSDM'11","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 fourth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1935826.1935903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:34Z","timestamp":1750250734000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1935826.1935903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":24,"alternative-id":["10.1145\/1935826.1935903","10.1145\/1935826"],"URL":"https:\/\/doi.org\/10.1145\/1935826.1935903","relation":{},"subject":[],"published":{"date-parts":[[2011,2,9]]},"assertion":[{"value":"2011-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}