{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:56:28Z","timestamp":1759683388323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030438869"},{"type":"electronic","value":"9783030438876"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43887-6_12","type":"book-chapter","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T15:03:32Z","timestamp":1585321412000},"page":"142-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Encoding Hierarchical Classification Codes for Privacy-Preserving Record Linkage Using Bloom Filters"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Schnell","sequence":"first","affiliation":[]},{"given":"Christian","family":"Borgs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,28]]},"reference":[{"issue":"7","key":"12_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-93040-4_42","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2018","unstructured":"Christen, P., Vidanage, A., Ranbaduge, T., Schnell, R.: Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 530\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_42"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A.: Bloofi: a hierarchical Bloom filter index with applications to distributed data provenance. In: Darmont, J., Pedersen, T.B. (eds.) Proceedings of the 2nd International Workshop on Cloud Intelligence (Cloud-I 2013) Riva del Garda, Trento, Italy, 26 August. ACM, New York (2013)","DOI":"10.1145\/2501928.2501931"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/JBHI.2018.2796941","volume":"22","author":"R Dantas Pita","year":"2018","unstructured":"Dantas Pita, R., et al.: On the accuracy and scalability of probabilistic data linkage over the Brazilian 114 million cohort. IEEE J. Biomed. Health Inform. 22(2), 346\u2013353 (2018)","journal-title":"IEEE J. Biomed. Health Inform."},{"key":"12_CR6","unstructured":"European Commission: Eurostat: European Statistics on Accidents at Work (ESAW): Summary Methodology. Publications Office of the European Union, Luxembourg (2013)"},{"key":"12_CR7","unstructured":"Farrow, J.: Privacy preserving distance-comparable geohashing. In: International Health Data Linkage Conference, Vancouver, 28\u201330 April (2014)"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11222-017-9746-6","volume":"28","author":"D Hand","year":"2017","unstructured":"Hand, D., Christen, P.: A note on using the F-measure for evaluating record linkage algorithms. Stat. Comput. 28(3), 539\u2013547 (2017). https:\/\/doi.org\/10.1007\/s11222-017-9746-6","journal-title":"Stat. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hejblum, B.P., et al.: Probabilistic record linkage of de-identified research datasets with discrepancies using diagnosis codes. Sci. Data 6, 180298\u2013180309 (2019). Article no. 180298","DOI":"10.1038\/sdata.2018.298"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.jsr.2016.09.005","volume":"59","author":"C Jacinto","year":"2016","unstructured":"Jacinto, C., Santos, F.P., Soares, C.G., Silva, S.A.: Assessing the coding reliability of work accidents statistical data: how coders make a difference. J. Saf. Res. 59, 9\u201321 (2016)","journal-title":"J. Saf. Res."},{"key":"12_CR11","unstructured":"Kerschbaum, F., Beck, M., Sch\u00f6nfeld, D.: Inference control for privacy-preserving genome matching. CoRR abs\/1405.0205 (2014)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11766247_34","volume-title":"Advances in Artificial Intelligence","author":"S Kiritchenko","year":"2006","unstructured":"Kiritchenko, S., Matwin, S., Nock, R., Famili, A.F.: Learning and evaluation in the presence of class hierarchies: application to text categorization. In: Lamontagne, L., Marchand, M. (eds.) AI 2006. LNCS (LNAI), vol. 4013, pp. 395\u2013406. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11766247_34"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1055\/s-0028-1102929","volume":"71","author":"SJ Klug","year":"2009","unstructured":"Klug, S.J., Bardehle, D., Ressing, M., Schmidtmann, I., Blettner, M.: Vergleich von ICD-Kodierungen zwischen Mortalit\u00e4tsstatistik und studieninterner retrospektiver Nachkodierung. Gesundheitswesen 71(4), 220\u2013225 (2009)","journal-title":"Gesundheitswesen"},{"key":"12_CR14","unstructured":"Koloniari, G., Pitoura, E.: Bloom-based filters for hierarchical data. In: 5th Workshop on Distributed Data and Structures, Thessaloniki, 13\u201314 June 2003 (2003)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-hashing for message authentication. Internet RFC 2104 (1997)","DOI":"10.17487\/rfc2104"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-5-9","volume":"5","author":"TG Kristensen","year":"2010","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.S.: A tree-based method for the rapid screening of chemical fingerprints. Algorithms Mol. Biol. 5(1), 9\u201320 (2010)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"12_CR17","first-page":"81","volume":"13","author":"D Lillis","year":"2018","unstructured":"Lillis, D., Breitinger, F., Scanlon, M.: Hierarchical Bloom filter trees for approximate matching. J. Digital Forensics Secur. Law 13(1), 81\u201396 (2018)","journal-title":"J. Digital Forensics Secur. Law"},{"issue":"Suppl. 1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"A61","DOI":"10.1136\/oemed-2011-100382.196","volume":"68","author":"D McLean","year":"2011","unstructured":"McLean, D., et al.: Evaluation of the quality and comparability of job coding across seven countries in the INTEROCC study. Occup. Environ. Med. 68(Suppl. 1), A61 (2011)","journal-title":"Occup. Environ. Med."},{"key":"12_CR19","unstructured":"National Institute of Standards and Technology: Secure hash standard (SHS). FIPS PUB 180-4 (2012)"},{"key":"12_CR20","unstructured":"Peruzzi, M., Zachmann, G., Veugelers, R.: Remerge: regression-based record linkage with an application to PATSTAT. Technical report 2014\/10iii, Bruegel Working Paper, Brussels (2014)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/T-C.1974.223971","volume":"5","author":"EM Riseman","year":"1974","unstructured":"Riseman, E.M., Hanson, A.R.: A contextual postprocessing system for error correction using binary n-grams. IEEE Trans. Comput. 5, 480\u2013493 (1974)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"12_CR22","first-page":"263","volume":"30","author":"R Schnell","year":"2014","unstructured":"Schnell, R.: An efficient privacy-preserving record linkage technique for administrative data and censuses. J. Int. Assoc. Off. Stat. 30(3), 263\u2013270 (2014)","journal-title":"J. Int. Assoc. Off. Stat."},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/9781119072454.ch9","volume-title":"Methodological Developments in Data Linkage","author":"R Schnell","year":"2016","unstructured":"Schnell, R.: Privacy-preserving record linkage. In: Harron, K., Goldstein, H., Dibben, C. (eds.) Methodological Developments in Data Linkage, pp. 201\u2013225. Wiley, Hoboken (2016)"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 41\u201352 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Schnell, R., Richter, A., Borgs, C.: A comparison of statistical linkage keys with Bloom filter-based encryptions for privacy-preserving record linkage using real-world mammography data. In: Proceedings of the 10th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2017), pp. 276\u2013283 (2017)","DOI":"10.5220\/0006140302760283"},{"key":"12_CR26","first-page":"271","volume":"34","author":"D Smith","year":"2017","unstructured":"Smith, D.: Secure pseudonymisation for privacy-preserving probabilistic record linkage. J. Inf. Secur. Appl. 34, 271\u2013279 (2017)","journal-title":"J. Inf. Secur. Appl."},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ipm.2009.03.002","volume":"45","author":"M Sokolova","year":"2009","unstructured":"Sokolova, M., Lapalme, G.: A systematic analysis of performance measures for classification tasks. Inf. Process. Manage. 45(4), 427\u2013437 (2009)","journal-title":"Inf. Process. Manage."},{"issue":"4","key":"12_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s12651-013-0150-1","volume":"46","author":"M Trappmann","year":"2013","unstructured":"Trappmann, M., Beste, J., Bethmann, A., M\u00fcller, G.: The PASS panel survey after six waves. J. Labour Market Res. 46(4), 275\u2013281 (2013)","journal-title":"J. Labour Market Res."},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jbi.2015.12.004","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan, D., Christen, P.: Privacy-preserving matching of similar patients. J. Biomed. Inform. 59, 285\u2013298 (2016)","journal-title":"J. Biomed. Inform."}],"container-title":["Communications in Computer and Information Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43887-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T01:05:30Z","timestamp":1707786330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43887-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030438869","9783030438876"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43887-6_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"130","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}