{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T15:04:52Z","timestamp":1775747092433,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"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":[[2020,1,20]]},"DOI":"10.1145\/3336191.3371813","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:08:16Z","timestamp":1579720096000},"page":"744-752","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["AutoBlock"],"prefix":"10.1145","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wei","sequence":"additional","affiliation":[{"name":"Amazon.com, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bunyamin","family":"Sisman","sequence":"additional","affiliation":[{"name":"Amazon.com, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin Luna","family":"Dong","sequence":"additional","affiliation":[{"name":"Amazon.com, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davd","family":"Page","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"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","first-page":"1225","volume-title":"Advances in Neural Information Processing System","author":"Andoni A.","year":"2015","unstructured":"Andoni , A. , Indyk , P. , Laarhoven , T. , Razenshteyn , I. P. , and Schmidt , L . ( 2015 ). Practical and Optimal LSH for Angular Distance . In Advances in Neural Information Processing System , pages 1225 -- 1233 . Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I. P., and Schmidt, L. (2015). Practical and Optimal LSH for Angular Distance. In Advances in Neural Information Processing System, pages 1225--1233."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00051"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077257.3077268"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544914"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236198"},{"key":"e_1_3_2_1_11_1","volume-title":"Department of Computer Science","author":"Gravano L.","year":"2003","unstructured":"Gravano , L. , Jagadish , H. V. , Ipeirotis , P. G. , Srivastava , D. , Koudas , N. , and Muthukrishnan , S . ( 2003 ). Approximate String Joins in a Database (Almost) for Free--Erratum. Technical report , Department of Computer Science , Columbia University . Gravano, L., Jagadish, H. V., Ipeirotis, P. G., Srivastava, D., Koudas, N., and Muthukrishnan, S. (2003). Approximate String Joins in a Database (Almost) for Free--Erratum. Technical report, Department of Computer Science, Columbia University."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a014"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_14_1","first-page":"449","volume-title":"Noise-tolerant Approximate Blocking for Dynamic Real-time Entity Resolution. In Pacific-Asia Conference on Knowledge Discovery and Data Mining","volume":"8444","author":"Liang H.","year":"2014","unstructured":"Liang , H. , Wang , Y. , Christen , P. , and Gayler , R . ( 2014 ). Noise-tolerant Approximate Blocking for Dynamic Real-time Entity Resolution. In Pacific-Asia Conference on Knowledge Discovery and Data Mining , volume 8444 , pages 449 -- 460 . Springer. Liang, H., Wang, Y., Christen, P., and Gayler, R. (2014). Noise-tolerant Approximate Blocking for Dynamic Real-time Entity Resolution. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, volume 8444, pages 449--460. Springer."},{"key":"e_1_3_2_1_15_1","volume-title":"Natural Language Processing with Python . O'Reilly","author":"Loper E.","year":"2009","unstructured":"Loper , E. , Klein , E. , and Bird , S . ( 2009 ). Natural Language Processing with Python . O'Reilly . Loper, E., Klein, E., and Bird, S. (2009). Natural Language Processing with Python . O'Reilly."},{"key":"e_1_3_2_1_16_1","volume-title":"Quality in Databases.","author":"McNeill W. P.","year":"2012","unstructured":"McNeill , W. P. , Kardes , H. , and Borthwick , A . ( 2012 ). Dynamic Record Blocking: Efficient Linking of Massive Databases in MapReduce . In Quality in Databases. McNeill, W. P., Kardes, H., and Borthwick, A. (2012). Dynamic Record Blocking: Efficient Linking of Massive Databases in MapReduce. In Quality in Databases."},{"key":"e_1_3_2_1_17_1","first-page":"2965","volume-title":"Proceedings of the 21st national conference on Artificial intelligence","author":"Michelson M.","unstructured":"Michelson , M. and Knoblock , C . a. (2006). Learning Blocking Schemes for Record Linkage . In Proceedings of the 21st national conference on Artificial intelligence , pages 2965 -- 2967 . Michelson, M. and Knoblock, C. a. (2006). Learning Blocking Schemes for Record Linkage. In Proceedings of the 21st national conference on Artificial intelligence, pages 2965--2967."},{"key":"e_1_3_2_1_18_1","volume-title":"Efficient Estimation of Word Representations in Vector Space. arXiv preprint","author":"Mikolov T.","year":"2013","unstructured":"Mikolov , T. , Corrado , G. , Chen , K. , and Dean , J . ( 2013 ). Efficient Estimation of Word Representations in Vector Space. arXiv preprint , 2015-Janua(3):1--12. Mikolov, T., Corrado, G., Chen, K., and Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. arXiv preprint, 2015-Janua(3):1--12."},{"key":"e_1_3_2_1_19_1","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","unstructured":"Nocedal , J. and Wright , S . ( 2006 ). Numerical Optimization . Springer-Verlag New York , 2 edition. Nocedal, J. and Wright, S. (2006). Numerical Optimization . Springer-Verlag New York, 2 edition."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.150"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.54"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733098"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2016.08.002"},{"key":"e_1_3_2_1_24_1","first-page":"684","volume-title":"Comparative Analysis of Approximate Blocking Techniques for Entity Resolution. In Proceedings of the VLDB Endowment","volume":"9","author":"Papadakis G.","unstructured":"Papadakis , G. , Svirsky , J. , Gal , A. , and Palpanas , T . (2016b) . Comparative Analysis of Approximate Blocking Techniques for Entity Resolution. In Proceedings of the VLDB Endowment , volume 9 , pages 684 -- 695 . VLDB Endowment. Papadakis, G., Svirsky, J., Gal, A., and Palpanas, T. (2016b). Comparative Analysis of Approximate Blocking Techniques for Entity Resolution. In Proceedings of the VLDB Endowment, volume 9, pages 684--695. VLDB Endowment."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994533"},{"key":"e_1_3_2_1_27_1","volume-title":"Advances in Neural Information Processing System.","author":"Vaswani A.","year":"2017","unstructured":"Vaswani , A. , Shazeer , N. , Parmar , N. , Uszkoreit , J. , Jones , L. , Gomez , A. N. , Kaiser , L. , and Polosukhin , I . ( 2017 ). Attention is All you Need . In Advances in Neural Information Processing System. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., and Polosukhin, I. (2017). Attention is All you Need. In Advances in Neural Information Processing System."}],"event":{"name":"WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining","location":"Houston TX USA","acronym":"WSDM '20","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 13th International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371813","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3336191.3371813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:14Z","timestamp":1750202594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3336191.3371813"}},"subtitle":["A Hands-off Blocking Framework for Entity Matching"],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":27,"alternative-id":["10.1145\/3336191.3371813","10.1145\/3336191"],"URL":"https:\/\/doi.org\/10.1145\/3336191.3371813","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}