{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:03Z","timestamp":1750307583230,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T00:00:00Z","timestamp":1258329600000},"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":["SIGKDD Explor. Newsl."],"published-print":{"date-parts":[[2009,11,16]]},"abstract":"<jats:p>Record linkage, also known as database matching or entity resolution, is now recognised as a core step in the KDD process. Data mining projects increasingly require that information from several sources is combined before the actual mining can be conducted. Also of increasing interest is the deduplication of a single database. The objectives of record linkage and deduplication are to identify, match and merge all records that relate to the same real-world entities. Because real-world data is commonly 'dirty', data cleaning is an important first step in many deduplication, record linkage, and data mining project.<\/jats:p>\n          <jats:p>In this paper, an overview of the Febrl (Freely Extensible Biomedical Record Linkage) system is provided, and the results of a recent survey of Febrl users is discussed. Febrl includes a variety of functionalities required for data cleaning, deduplication and record linkage, and it provides a graphical user interface that facilitates its application for users who do not have programming experience.<\/jats:p>","DOI":"10.1145\/1656274.1656282","type":"journal-article","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T15:21:01Z","timestamp":1259076061000},"page":"39-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Development and user experiences of an open source data cleaning, deduplication and record linkage system"],"prefix":"10.1145","volume":"11","author":[{"given":"Peter","family":"Christen","sequence":"first","affiliation":[{"name":"The Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,11,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1105926.1106227"},{"key":"e_1_2_1_2_1","first-page":"25","volume-title":"ACM SIGKDD'03 workshop on Data Cleaning, Record Linkage and Object Consolidation","author":"Baxter R.","year":"2003","unstructured":"R. Baxter , P. Christen , and T. Churches . A comparison of fast blocking methods for record linkage . In ACM SIGKDD'03 workshop on Data Cleaning, Record Linkage and Object Consolidation , pages 25 -- 27 , Washington DC , 2003 . R. Baxter, P. Christen, and T. Churches. A comparison of fast blocking methods for record linkage. In ACM SIGKDD'03 workshop on Data Cleaning, Record Linkage and Object Consolidation, pages 25--27, Washington DC, 2003."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.2"},{"key":"e_1_2_1_4_1","first-page":"111","volume-title":"Australasian Data Mining Conference (AusDM'07)","volume":"70","author":"Christen P.","year":"2007","unstructured":"P. Christen . A two-step classification approach to unsupervised record linkage . In Australasian Data Mining Conference (AusDM'07) , Conferences in Research and Practice in Information Technology (CRPIT) , volume 70 , pages 111 -- 119 , Gold Coast, Australia, 2007 . P. Christen. A two-step classification approach to unsupervised record linkage. In Australasian Data Mining Conference (AusDM'07), Conferences in Research and Practice in Information Technology (CRPIT), volume 70, pages 111--119, Gold Coast, Australia, 2007."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401913"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786574.1786623"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402020"},{"key":"e_1_2_1_8_1","first-page":"53","volume-title":"Australasian Data Mining Conference (AusDM'05)","author":"Christen P.","year":"2005","unstructured":"P. Christen and D. Belacic . Automated probabilistic address standardisation and verification . In Australasian Data Mining Conference (AusDM'05) , pages 53 -- 67 , Sydney , 2005 . P. Christen and D. Belacic. Automated probabilistic address standardisation and verification. In Australasian Data Mining Conference (AusDM'05), pages 53--67, Sydney, 2005."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24775-3_75"},{"key":"e_1_2_1_10_1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-44918-8_6","volume-title":"Quality Measures in Data Mining","author":"Christen P.","year":"2007","unstructured":"P. Christen and K. Goiser . Quality and complexity measures for data linkage and deduplication . In F. Guillet and H. Hamilton, editors, Quality Measures in Data Mining , volume 43 of Studies in Computational Intelligence , pages 127 -- 151 . Springer , 2007 . P. Christen and K. Goiser. Quality and complexity measures for data linkage and deduplication. In F. Guillet and H. Hamilton, editors, Quality Measures in Data Mining, volume 43 of Studies in Computational Intelligence, pages 127--151. Springer, 2007."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01307-2_47"},{"key":"e_1_2_1_12_1","volume-title":"Preparation of name and address data for record linkage using hidden Markov models. BioMed Central Medical Informatics and Decision Making, 2(9)","author":"Churches T.","year":"2002","unstructured":"T. Churches , P. Christen , K. Lim , and J.X. Zhu . Preparation of name and address data for record linkage using hidden Markov models. BioMed Central Medical Informatics and Decision Making, 2(9) , 2002 . T. Churches, P. Christen, K. Lim, and J.X. Zhu. Preparation of name and address data for record linkage using hidden Markov models. BioMed Central Medical Informatics and Decision Making, 2(9), 2002."},{"issue":"3","key":"e_1_2_1_13_1","first-page":"186","article-title":"Practical introduction to record linkage for injury research","volume":"10","author":"Clark D.E.","year":"2004","unstructured":"D.E. Clark . Practical introduction to record linkage for injury research . British Medical Journal , 10 ( 3 ): 186 -- 191 , 2004 . D.E. Clark. Practical introduction to record linkage for injury research. British Medical Journal, 10(3):186--191, 2004.","journal-title":"British Medical Journal"},{"volume-title":"Workshop on Information Integration on the Web (IIWeb'03)","author":"Cohen W.W.","key":"e_1_2_1_14_1","unstructured":"W.W. Cohen , P. Ravikumar , and S. Fienberg . A comparison of string distance metrics for name-matching tasks . In Workshop on Information Integration on the Web (IIWeb'03) , held at IJCAI'03, pages 73--78, Acapulco, 2003. W.W. Cohen, P. Ravikumar, and S. Fienberg. A comparison of string distance metrics for name-matching tasks. In Workshop on Information Integration on the Web (IIWeb'03), held at IJCAI'03, pages 73--78, Acapulco, 2003."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775116"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_2_1_18_1","first-page":"23","volume-title":"Australasian Data Mining Conference (AusDM'06)","volume":"61","author":"Goiser K.","year":"2006","unstructured":"K. Goiser and P. Christen . Towards automated record linkage . In Australasian Data Mining Conference (AusDM'06) , Conferences in Research and Practice in Information Technology (CRPIT) , volume 61 , pages 23 -- 31 , Sydney, 2006 . K. Goiser and P. Christen. Towards automated record linkage. In Australasian Data Mining Conference (AusDM'06), Conferences in Research and Practice in Information Technology (CRPIT), volume 61, pages 23--31, Sydney, 2006."},{"key":"e_1_2_1_19_1","first-page":"146","volume-title":"Selected Papers from AusDM","author":"Gu L.","year":"2006","unstructured":"L. Gu and R. Baxter . Decision models for record linkage . In Selected Papers from AusDM , Springer LNCS 3755, pages 146 -- 160 , 2006 . L. Gu and R. Baxter. Decision models for record linkage. In Selected Papers from AusDM, Springer LNCS 3755, pages 146--160, 2006."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_2_1_21_1","first-page":"137","volume-title":"International Conference on Database Systems for Advanced Applications (DASFAA'03)","author":"Jin L.","year":"2003","unstructured":"L. Jin , C. Li , and S. Mehrotra . Efficient record linkage in large data sets . In International Conference on Database Systems for Advanced Applications (DASFAA'03) , pages 137 -- 146 , Tokyo , 2003 . L. Jin, C. Li, and S. Mehrotra. Efficient record linkage in large data sets. In International Conference on Database Systems for Advanced Applications (DASFAA'03), pages 137--146, Tokyo, 2003."},{"key":"e_1_2_1_22_1","volume-title":"Data mining with Rattle and R. Togaware","author":"Williams G.","year":"2009","unstructured":"G. Williams . Data mining with Rattle and R. Togaware , Canberra , 2009 . Software available at: http:\/\/rattle.togaware.com. G. Williams. Data mining with Rattle and R. Togaware, Canberra, 2009. Software available at: http:\/\/rattle.togaware.com."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.12.003"}],"container-title":["ACM SIGKDD Explorations Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1656274.1656282","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1656274.1656282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:18Z","timestamp":1750250478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1656274.1656282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,16]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,11,16]]}},"alternative-id":["10.1145\/1656274.1656282"],"URL":"https:\/\/doi.org\/10.1145\/1656274.1656282","relation":{},"ISSN":["1931-0145","1931-0153"],"issn-type":[{"type":"print","value":"1931-0145"},{"type":"electronic","value":"1931-0153"}],"subject":[],"published":{"date-parts":[[2009,11,16]]},"assertion":[{"value":"2009-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}