{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:06:23Z","timestamp":1775012783724,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,6]],"date-time":"2010-06-06T00:00:00Z","timestamp":1275782400000},"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":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807252","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"783-794","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":120,"title":["On active learning of record matching packages"],"prefix":"10.1145","author":[{"given":"Arvind","family":"Arasu","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michaela","family":"G\u00f6tz","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghav","family":"Kaushik","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287420"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164206"},{"key":"e_1_3_2_1_3_1","volume-title":"Committee-based sample selection for probabilistic classifiers. J. Artif. Intell. Res. (JAIR), 11:335--360","author":"Argamon-Engelson S.","year":"1999","unstructured":"S. Argamon-Engelson and I. Dagan . Committee-based sample selection for probabilistic classifiers. J. Artif. Intell. Res. (JAIR), 11:335--360 , 1999 . S. Argamon-Engelson and I. Dagan. Committee-based sample selection for probabilistic classifiers. J. Artif. Intell. Res. (JAIR), 11:335--360, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/553876"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956759"},{"key":"e_1_3_2_1_8_1","first-page":"7","volume-title":"Proc. of the ACM SIGKDD-03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation","author":"Bilenko M.","year":"2003","unstructured":"M. Bilenko and R. J. Mooney . On evaluation and training-set construction for duplicate detection . In Proc. of the ACM SIGKDD-03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation , pages 7 -- 12 , Aug. 2003 . M. Bilenko and R. J. Mooney. On evaluation and training-set construction for duplicate detection. In Proc. of the ACM SIGKDD-03 Workshop on Data Cleaning, Record Linkage, and Object Consolidation, pages 7--12, Aug. 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247521"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325891"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_13_1","unstructured":"Citeseer. http:\/\/citeseerx.ist.psu.edu\/.  Citeseer. http:\/\/citeseerx.ist.psu.edu\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/352595.352598"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022673506211"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_3_2_1_17_1","first-page":"235","volume-title":"Advances in Neural Information Processing Systems 18","author":"Dasgupta S.","year":"2006","unstructured":"S. Dasgupta . Coarse sample complexity bounds for active learning . In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18 , pages 235 -- 242 . MIT Press , Cambridge, MA , 2006 . S. Dasgupta. Coarse sample complexity bounds for active learning. In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 235--242. MIT Press, Cambridge, MA, 2006."},{"key":"e_1_3_2_1_18_1","unstructured":"The DBLP computer science bibliography. http:\/\/www.informatik.uni-trier.de\/~ley\/db\/.  The DBLP computer science bibliography. http:\/\/www.informatik.uni-trier.de\/~ley\/db\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066168"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007330508534"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276685"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645927.672200"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497435"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273541"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_3_2_1_29_1","volume-title":"Unimatch: A record linkage system: User's manual. Technical report","author":"Jaro M. A.","year":"1976","unstructured":"M. A. Jaro . Unimatch: A record linkage system: User's manual. Technical report , US Bureau of the Census, Washington DC, 1976 . M. A. Jaro. Unimatch: A record linkage system: User's manual. Technical report, US Bureau of the Census, Washington DC, 1976."},{"key":"e_1_3_2_1_30_1","first-page":"881","volume-title":"Proc. of the 8th Annual ACM-SIAM Symp. on Discrete Algorithms","author":"Karp R. M.","year":"2007","unstructured":"R. M. Karp and R. Kleinberg . Noisy binary search and its applications . In Proc. of the 8th Annual ACM-SIAM Symp. on Discrete Algorithms , pages 881 -- 890 , Jan. 2007 . R. M. Karp and R. Kleinberg. Noisy binary search and its applications. In Proc. of the 8th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 881--890, Jan. 2007."},{"key":"e_1_3_2_1_31_1","first-page":"303","volume-title":"Proc. of the 33rd Intl. Conf. on Very Large Data Bases","author":"Li C.","year":"2007","unstructured":"C. Li , B. Wang , and X. Yang . Vgram: Improving performance of approximate queries on string collections using variable-length grams . In Proc. of the 33rd Intl. Conf. on Very Large Data Bases , pages 303 -- 314 , Sept. 2007 . C. Li, B. Wang, and X. Yang. Vgram: Improving performance of approximate queries on string collections using variable-length grams. In Proc. of the 33rd Intl. Conf. on Very Large Data Bases, pages 303--314, Sept. 2007."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/541177"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. of the 1st SIGMOD workshop on data mining and knowledge discovery","author":"Monge A.","year":"1997","unstructured":"A. Monge and C. Elkan . An efficient domain-independent algorithm for detecting approximately duplicate database records . In Proc. of the 1st SIGMOD workshop on data mining and knowledge discovery , 1997 . A. Monge and C. Elkan. An efficient domain-independent algorithm for detecting approximately duplicate database records. In Proc. of the 1st SIGMOD workshop on data mining and knowledge discovery, 1997."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081923"},{"key":"e_1_3_2_1_36_1","volume-title":"Morgan Kaufman","author":"Quinlan J. R.","year":"1993","unstructured":"J. R. Quinlan . C4.5 : Programs for Machine Learning . Morgan Kaufman , 1993 . J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufman, 1993."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775087"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_3_2_1_39_1","first-page":"31","volume-title":"Proc. of the 3rd KDD Workshop on Multi-Relational Data Mining","author":"Singla P.","year":"2004","unstructured":"P. Singla and P. Domingos . Multi-relational record linkage . In Proc. of the 3rd KDD Workshop on Multi-Relational Data Mining , pages 31 -- 48 , 2004 . P. Singla and P. Domingos. Multi-relational record linkage. In Proc. of the 3rd KDD Workshop on Multi-Relational Data Mining, pages 31--48, 2004."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(01)00042-4"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760185243"},{"key":"e_1_3_2_1_42_1","volume-title":"Statistical Research Division","author":"Winkler W.","year":"1999","unstructured":"W. Winkler . The state of record linkage and current research problems. Technical report , Statistical Research Division , U.S. Bureau of the Census, Washington DC, 1999 . W. Winkler. The state of record linkage and current research problems. Technical report, Statistical Research Division, U.S. Bureau of the Census, Washington DC, 1999."},{"key":"e_1_3_2_1_43_1","volume-title":"Statistical Research Division","author":"Winkler W. E.","year":"1993","unstructured":"W. E. Winkler . Improved decision rules in the Felligi-Sunter model of record linkage. Technical report , Statistical Research Division , U.S. Bureau of the Census, Washington DC, 1993 . W. E. Winkler. Improved decision rules in the Felligi-Sunter model of record linkage. Technical report, Statistical Research Division, U.S. Bureau of the Census, Washington DC, 1993."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502540"}],"event":{"name":"SIGMOD\/PODS '10: International Conference on Management of Data","location":"Indianapolis Indiana USA","acronym":"SIGMOD\/PODS '10","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807252","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:33Z","timestamp":1750246773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":44,"alternative-id":["10.1145\/1807167.1807252","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807252","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}