{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:06:47Z","timestamp":1726081607746},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461645"},{"type":"electronic","value":"9783030461652"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46165-2_3","type":"book-chapter","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T08:03:58Z","timestamp":1588061038000},"page":"26-38","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Sequential and Parallel Algorithms for Incremental Record Linkage"],"prefix":"10.1007","author":[{"given":"Abdullah","family":"Baihan","sequence":"first","affiliation":[]},{"given":"Reda","family":"Ammar","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Aseltine","sequence":"additional","affiliation":[]},{"given":"Mohammed","family":"Baihan","sequence":"additional","affiliation":[]},{"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Koudas, N., Sarawagi, S., Srivastava, D.: Record linkage: similarity measures and algorithms. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of data, pp. 802\u2013803. ACM (2006)","DOI":"10.1145\/1142473.1142599"},{"issue":"10","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1002\/sim.1147","volume":"21","author":"S Gomatam","year":"2002","unstructured":"Gomatam, S., Carter, R., Ariet, M., et al.: An empirical comparison of record linkage procedures. Stat. Med. 21(10), 1485\u20131496 (2002). https:\/\/doi.org\/10.1002\/sim.1147 . PMID: 12185898","journal-title":"Stat. Med."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Winkler, W.E.: Overview of record linkage and current research directions. In: Bureau of the Census. Citeseer (2006)","DOI":"10.1002\/9780470057339.var022"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-540-24775-3_75","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2004","unstructured":"Christen, P., Churches, T., Hegland, M.: Febrl \u2013 a parallel open source data linkage system. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 638\u2013647. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24775-3_75"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Christen, P.: Febrl\u2014a freely available record linkage system with a graphical user interface. In: Second Australasian Workshop on Health Data and Knowledge Management, vol. 80, pp. 17\u201325 (2008)","DOI":"10.1145\/1401890.1402020"},{"key":"3_CR6","unstructured":"Jurczyk, P., Lu, J.J., Xiong, L., et al.: FRIL: a tool for comparative record linkage. In: AMIA Annual Symposium Proceedings, vol. 2008. American Medical Informatics Association, p. 440 (2008)"},{"issue":"11","key":"3_CR7","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1002\/bdra.2052","volume":"82","author":"P Jurczyk","year":"2008","unstructured":"Jurczyk, P., Lu, J.J., Xiong, L., et al.: Fine-grained record integration and linkage tool. Birth Defects Res. Part A: Clin. Mol. Teratol. 82(11), 822\u2013829 (2008). https:\/\/doi.org\/10.1002\/bdra.2052","journal-title":"Birth Defects Res. Part A: Clin. Mol. Teratol."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Lee, M.L., Ling, T.W., Low, W.L.: IntelliClean: a knowledge-based intelligent data cleaner. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 290\u2013294. ACM (2000)","DOI":"10.1145\/347090.347154"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1186\/1472-6947-12-59","volume":"12","author":"T Mi","year":"2012","unstructured":"Mi, T., Rajasekaran, S., Aseltine, R.: Efficient algorithms for fast integration on large data sets from multiple sources. BMC Med. Inform. Decis. Making 12(1), 59 (2012). https:\/\/doi.org\/10.1186\/1472-6947-12-59 . PMID: 22741525","journal-title":"BMC Med. Inform. Decis. Making"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Mi, T., Aseltine, R., Rajasekaran, S.: Data integration on multiple data sets. In: 2008 IEEE International Conference on Bioinformatics and Biomedicine. BIBM 2008, pp. 443\u2013446. IEEE (2008)","DOI":"10.1109\/BIBM.2008.48"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1177\/0962280211403600","volume":"22","author":"X Li","year":"2013","unstructured":"Li, X., Shen, C.: Linkage of patient records from disparate sources. Stat. Methods Med. Res. 22(1), 31\u201338 (2013). https:\/\/doi.org\/10.1177\/0962280211403600 . PMID: 21665896","journal-title":"Stat. Methods Med. Res."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1136\/amiajnl-2013-002034","volume":"21","author":"AA Mamun","year":"2014","unstructured":"Mamun, A.A., Mi, T., Aseltine, R., Rajasekaran, S.: Efficient sequential and parallel algorithms for record linkage. J. Am. Med. Inform. Assoc. 21(2), 252\u2013262 (2014). https:\/\/doi.org\/10.1136\/amiajnl-2013-002034 . PMID: 24154837","journal-title":"J. Am. Med. Inform. Assoc."},{"issue":"9","key":"3_CR13","doi-asserted-by":"publisher","first-page":"697","DOI":"10.14778\/2732939.2732943","volume":"7","author":"A Gruenheid","year":"2014","unstructured":"Gruenheid, A., Dong, X.L., Srivastava, D.: Incremental record linkage. Proc. VLDB Endow. 7(9), 697\u2013708 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.14778\/1920841.1921004","volume":"3","author":"SE Whang","year":"2010","unstructured":"Whang, S.E., Garcia-Molina, H.: Entity resolution with evolving rules. Proc. VLDB 3(1), 1326\u20131337 (2010)","journal-title":"Proc. VLDB"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00778-013-0315-0","volume":"23","author":"SE Whang","year":"2013","unstructured":"Whang, S.E., Garcia-Molina, H.: Incremental entity resolution on rules and data. VLDB J. 23(1), 77\u2013102 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0315-0","journal-title":"VLDB J."},{"key":"3_CR16","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":"3_CR17","unstructured":"Gu, L., Baxter, R., Vickers, D., et al.: Record linkage: current practice and future directions. CSIRO Mathematical and Information Sciences Technical Report 3\/83 (2003)"},{"issue":"3","key":"3_CR18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.58729\/1941-6687.1324","volume":"6","author":"DG Brizan","year":"2015","unstructured":"Brizan, D.G., Tansel, A.U.A.: Survey of entity resolution and record linkage methodologies. Commun. IIMA 6(3), 5 (2015)","journal-title":"Commun. IIMA"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Rajasekaran, S.: Efficient parallel hierarchical clustering algorithms. IEEE Trans. Parallel Distrib. Syst. (6), 497\u2013502 (2005). https:\/\/doi.org\/10.1109\/tpds.2005.72","DOI":"10.1109\/tpds.2005.72"},{"issue":"11","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/34.61708","volume":"12","author":"X Li","year":"1990","unstructured":"Li, X.: Parallel algorithms for hierarchical clustering and cluster validity. IEEE Trans. Pattern Anal. Mach. Intell. 12(11), 1088\u20131092 (1990). https:\/\/doi.org\/10.1109\/34.61708","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. 21(8), 1313\u20131325 (1995). https:\/\/doi.org\/10.1016\/0167-8191(95)00017-i","DOI":"10.1016\/0167-8191(95)00017-i"},{"issue":"9","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1006\/jpdc.2000.1644","volume":"60","author":"CH Wu","year":"2000","unstructured":"Wu, C.H., Horng, S.J., Tsai, H.R.: Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses. J. Parallel Distrib. Comput. 60(9), 1137\u20131153 (2000). https:\/\/doi.org\/10.1006\/jpdc.2000.1644","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR23","unstructured":"Kawai, H., Garcia-Molina, H., Benjelloun, O., et al.: P-swoosh: parallel algorithm for generic entity resolution (2006)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Kim, H.S., Lee, D.: Parallel linkage. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, pp. 283\u2013292. ACM (2007)","DOI":"10.1145\/1321440.1321482"},{"key":"3_CR25","unstructured":"Kirsten, T., Kolb, L., Hartung, M., et al.: Data partitioning for parallel entity matching. arXiv preprint arXiv:10065309 (2010)"},{"key":"3_CR26","unstructured":"Bianco, G.D., Galante, R., Heuser, C.A.: A fast approach for parallel deduplication on multicore processors. In: Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 1027\u20131032. ACM (2011)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-11257-2_20","volume-title":"Privacy in Statistical Databases","author":"RC Steorts","year":"2014","unstructured":"Steorts, R.C., Ventura, S.L., Sadinle, M., Fienberg, S.E.: A comparison of blocking methods for record linkage. In: Domingo-Ferrer, J. (ed.) PSD 2014. LNCS, vol. 8744, pp. 253\u2013268. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11257-2_20"},{"issue":"9","key":"3_CR28","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","volume":"24","author":"P Christen","year":"2012","unstructured":"Christen, P.: A survey of indexing techniques for scalable record linkage and deduplication. IEEE Trans. Knowl. Data Eng. 24(9), 1537\u20131555 (2012). https:\/\/doi.org\/10.1109\/TKDE.2011.127","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Bachteler, T., Reiher, J., Schnell, R.: Similarity filtering with multibit trees for record linkage. German Record Linkage Center, Nuremberg, Working Paper WP-GRLC-2013-02 (2013)","DOI":"10.2139\/ssrn.3530899"},{"key":"3_CR30","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady, vol. 10, pp. 707\u2013710 (1966)"},{"issue":"3","key":"3_CR31","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264\u2013323 (1999). https:\/\/doi.org\/10.1145\/331499.331504","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 169\u2013178. ACM (2000)","DOI":"10.1145\/347090.347123"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/0-387-25465-X_15","volume-title":"Data Mining and Knowledge Discovery Handbook","author":"L Rokach","year":"2005","unstructured":"Rokach, L., Maimon, O.: Clustering methods. In: Maimon, O., Rokach, L. (eds.) Data Mining and Knowledge Discovery Handbook, pp. 321\u2013352. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-25465-X_15"},{"key":"3_CR34","unstructured":"Connecticut Hospital Association: https:\/\/cthosp.org\/member-services\/chimedata\/chimedata-overview\/"},{"key":"3_CR35","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-0-585-27330-3_6","volume-title":"Parallel Algorithm Derivation and Program Transformation","author":"S Rajasekaran","year":"1993","unstructured":"Rajasekaran, S., Reif, J.H.: Derivation of randomized sorting and selection algorithms. In: Paige, R., Reif, J., Watcher, R. (eds.) Parallel Algorithm Derivation and Program Transformation. The Springer International Series in Engineering and Computer Science, vol. 231, pp. 187\u2013205. Springer, Boston (1993). https:\/\/doi.org\/10.1007\/978-0-585-27330-3_6"}],"container-title":["Lecture Notes in Computer Science","Computational Advances in Bio and Medical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46165-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T07:59:38Z","timestamp":1696060778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-46165-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461645","9783030461652"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46165-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCABS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Advances in Bio and Medical Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miami, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccabs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccabs.engr.uconn.edu\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"15","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":"50% - 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":"2,7","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":"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)"}}]}}