{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:38:42Z","timestamp":1743071922975,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030659646"},{"type":"electronic","value":"9783030659653"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65965-3_18","type":"book-chapter","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T19:48:52Z","timestamp":1612208932000},"page":"281-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hyper-Parameter Optimization for Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Joyce","family":"Yu","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Nabaglo","sequence":"additional","affiliation":[]},{"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[]},{"given":"Wilko","family":"Henecka","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Thorne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,2]]},"reference":[{"key":"18_CR1","unstructured":"Bergstra, J.S., Bardenet, R., Bengio, Y., K\u00e9gl, B.: Algorithms for hyper-parameter optimization. In: Advances in Neural Information Processing Systems, pp. 2546\u20132554 (2011)"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Borgs, C.: Optimal parameter choice for bloom filter-based privacy-preserving record linkage. Ph.D. thesis (2019). https:\/\/doi.org\/10.17185\/duepublico\/70274","DOI":"10.17185\/duepublico\/70274"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Brown, A.P., Randall, S.M., Boyd, J.H., Ferrante, A.M.: Evaluation of approximate comparison methods on bloom filters for probabilistic linkage. Int. J. Popul. Data Sci. 4(1) (2019)","DOI":"10.23889\/ijpds.v4i1.1095"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","volume":"31","author":"P Christen","year":"2018","unstructured":"Christen, P., Ranbaduge, T., Vatsalan, D., Schnell, R.: Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. IEEE Trans. Knowl. Data Eng. 31, 2164\u20132177 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR5","unstructured":"CSIRO\u2019s Data61: Anonlink private record linkage system (2017). https:\/\/github.com\/data61\/clkhash"},{"key":"18_CR6","unstructured":"Kuehni, C.E., et al.: Cohort profile: the Swiss childhood cancer survivor study. Int. J. Epidemiol. 41(6), 1553\u20131564 (2011)"},{"issue":"1","key":"18_CR7","first-page":"1","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall, S.M., Ferrante, A.M., Boyd, J.H., Semmens, J.B.: Privacy-preserving record linkage on large real world datasets. J. Biomed. Inform. 50(1), 1 (2014)","journal-title":"J. Biomed. Inform."},{"key":"18_CR8","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, Chichester (2016)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: A novel error-tolerant anonymous linking code. German Record Linkage Center, Working Paper Series No. WP-GRLC-2011-02 (2011)","DOI":"10.2139\/ssrn.3549247"},{"key":"18_CR10","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2951\u20132959 (2012)"},{"key":"18_CR11","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."},{"issue":"1","key":"18_CR12","first-page":"1","volume":"6","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan, D., Christen, P., O\u2019Keefe, C.M., Verykios, V.S.: An evaluation framework for privacy-preserving record linkage. J. Priv. Confid. 6(1), 1 (2014)","journal-title":"J. Priv. Confid."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Rahm, E.: Scalable privacy-preserving linking of multiple databases using counting Bloom filters. In: Workshop on Privacy and Discrimination in Data Mining held at IEEE ICDM, Barcelona (2016)","DOI":"10.1109\/ICDMW.2016.0130"},{"issue":"6","key":"18_CR14","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. Inf. Syst. 38(6), 946\u2013969 (2013)","journal-title":"Inf. Syst."}],"container-title":["Communications in Computer and Information Science","ECML PKDD 2020 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65965-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T11:39:16Z","timestamp":1619264356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65965-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030659646","9783030659653"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65965-3_18","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":"2 February 2021","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":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","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":"195","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":"21% - 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":"4,5","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":"4,4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}