{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T03:45:32Z","timestamp":1784864732448,"version":"3.55.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014856","name":"sps","doi-asserted-by":"publisher","award":["969"],"award-info":[{"award-number":["969"]}],"id":[{"id":"10.13039\/100014856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Entity resolution (ER) is the task of finding records that refer to the same real-world entities. A common scenario, which we refer to as Clean-Clean ER, is to resolve records across two clean sources (i.e., they are duplicate-free and contain one record per entity). Matching algorithms for Clean-Clean ER yield bipartite graphs, which are further processed by clustering algorithms to produce the end result. In this paper, we perform an extensive empirical evaluation of eight bipartite graph matching algorithms that take as input a bipartite similarity graph and provide as output a set of matched records. We consider a wide range of matching algorithms, including algorithms that have not previously been applied to ER, or have been evaluated only in other ER settings. We assess the relative performance of these algorithms with respect to accuracy and time efficiency over ten established real-world data sets, from which we generated over 700 different similarity graphs. Our results provide insights into the relative performance of these algorithms and guidelines for choosing the best one, depending on the data at\u00a0hand.<\/jats:p>","DOI":"10.1007\/s00778-023-00791-3","type":"journal-article","created":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T05:31:57Z","timestamp":1681795917000},"page":"1369-1400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An analysis of one-to-one matching algorithms for entity resolution"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7298-9431","authenticated-orcid":false,"given":"George","family":"Papadakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0683-030X","authenticated-orcid":false,"given":"Vasilis","family":"Efthymiou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9218-5027","authenticated-orcid":false,"given":"Emmanouil","family":"Thanos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-9857","authenticated-orcid":false,"given":"Oktie","family":"Hassanzadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2015","authenticated-orcid":false,"given":"Peter","family":"Christen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,18]]},"reference":[{"key":"791_CR1","doi-asserted-by":"crossref","unstructured":"Assi, A., Mcheick, H., Dhifli, W.: BIGMAT: a distributed affinity-preserving random walk strategy for instance matching on knowledge graphs. In: IEEE Big Data, pp. 1028\u20131033 (2019)","DOI":"10.1109\/BigData47090.2019.9006348"},{"key":"791_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.J.: Ann-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020)","journal-title":"Inf. Syst."},{"issue":"12","key":"791_CR3","doi-asserted-by":"publisher","first-page":"eabi8021","DOI":"10.1126\/sciadv.abi8021","volume":"8","author":"O Binette","year":"2022","unstructured":"Binette, O., Steorts, R.C.: (Almost) all of entity resolution. Sci. Adv. 8(12), eabi8021 (2022)","journal-title":"Sci. Adv."},{"key":"791_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1162\/tacl_a_00051","volume":"5","author":"P Bojanowski","year":"2017","unstructured":"Bojanowski, P., Grave, E., Joulin, A., Mikolov, T.: Enriching word vectors with subword information. Trans. Assoc. Comput. Linguist. 5, 135\u2013146 (2017)","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"791_CR5","unstructured":"Brunner, U., Stockinger, K.: Entity matching with transformer architectures\u2014a step forward in data integration. In: EDBT, pp. 463\u2013473 (2020)"},{"key":"791_CR6","unstructured":"Chapman, S.: Simmetrics: open source similarity measure library. http:\/\/sourceforge.net\/projects\/simmetrics\/ (2007)"},{"key":"791_CR7","volume-title":"Data Matching\u2014Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Data-Centric Systems and Applications","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching\u2014Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Data-Centric Systems and Applications. Springer, Berlin (2012)"},{"key":"791_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59706-1","volume-title":"Linking Sensitive Data","author":"P Christen","year":"2020","unstructured":"Christen, P., Ranbaduge, T., Schnell, R.: Linking Sensitive Data. Springer, Heidelberg (2020)"},{"issue":"6","key":"791_CR9","doi-asserted-by":"publisher","first-page":"127:1","DOI":"10.1145\/3418896","volume":"53","author":"V Christophides","year":"2021","unstructured":"Christophides, V., Efthymiou, V., Palpanas, T., Papadakis, G., Stefanidis, K.: An overview of end-to-end entity resolution for big data. ACM Comput. Surv. 53(6), 127:1-127:42 (2021)","journal-title":"ACM Comput. Surv."},{"key":"791_CR10","volume-title":"Algorithms","author":"S Dasgupta","year":"2008","unstructured":"Dasgupta, S., Papadimitriou, C.H., Vazirani, U.V.: Algorithms. McGraw-Hill, New York (2008)"},{"key":"791_CR11","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"791_CR12","unstructured":"Devlin, J., Chang, M., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: NAACL-HLT, pp. 4171\u20134186 (2019)"},{"key":"791_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01853-4","volume-title":"Big Data Integration. Synthesis Lectures on Data Management","author":"XL Dong","year":"2015","unstructured":"Dong, X.L., Srivastava, D.: Big Data Integration. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2015)"},{"issue":"1","key":"791_CR14","first-page":"3:1","volume":"12","author":"U Draisbach","year":"2020","unstructured":"Draisbach, U., Christen, P., Naumann, F.: Transforming pairwise duplicates to entity clusters for high-quality duplicate detection. ACM J. Data Inf. Qual. 12(1), 3:1-3:30 (2020)","journal-title":"ACM J. Data Inf. Qual."},{"key":"791_CR15","unstructured":"Efthymiou, V., Papadakis, G., Stefanidis, K., Christophides, V.: Minoaner: schema-agnostic, non-iterative, massively parallel resolution of web entities. In: EDBT, pp. 373\u2013384. OpenProceedings.org (2019)"},{"issue":"328","key":"791_CR16","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"Fellegi, I.P., Sunter, A.B.: A theory for record linkage. J. Am. Stat. Assoc. 64(328), 1183\u20131210 (1969)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"791_CR17","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"1","key":"791_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"791_CR19","unstructured":"Gemmell, J., Rubinstein, B.I.P., Chandra, A.K.: Improving entity resolution with global constraints. CoRR. arXiv:1108.6016 (2011)"},{"issue":"3","key":"791_CR20","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1410358.1410359","volume":"5","author":"G Giannakopoulos","year":"2008","unstructured":"Giannakopoulos, G., Karkaletsis, V., Vouros, G.A.: Summarization system evaluation revisited: N-gram graphs. ACM Trans. Speech Lang. Process. 5(3), 5:1-5:39 (2008)","journal-title":"ACM Trans. Speech Lang. Process."},{"key":"791_CR21","doi-asserted-by":"crossref","unstructured":"Giannakopoulos, G., Palpanas, T.: Content and type as orthogonal modeling features: a study on user interest awareness in entity subscription services. Int. J. Adv. Netw. Serv. 3(2) (2010)","DOI":"10.1109\/ComputationWorld.2009.75"},{"issue":"3","key":"791_CR22","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol. 162(3), 705\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"key":"791_CR23","doi-asserted-by":"publisher","unstructured":"Gutierrez, C., Sequeda, J.F.: Knowledge Graphs: A Tutorial on the History of Knowledge Graph\u2019s Main Ideas, pp. 3509\u20133510. Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3340531.3412176","DOI":"10.1145\/3340531.3412176"},{"issue":"3","key":"791_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10994-021-05964-1","volume":"110","author":"DJ Hand","year":"2021","unstructured":"Hand, D.J., Christen, P., Kirielle, N.: F*: an interpretable transformation of the f-measure. Mach. Learn. 110(3), 451\u2013456 (2021)","journal-title":"Mach. Learn."},{"issue":"1","key":"791_CR25","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.14778\/1687627.1687771","volume":"2","author":"O Hassanzadeh","year":"2009","unstructured":"Hassanzadeh, O., Chiang, F., Miller, R.J., Lee, H.C.: Framework for evaluating clustering algorithms in duplicate detection. Proc. VLDB Endow. 2(1), 1282\u20131293 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"48","key":"791_CR26","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.21105\/joss.02173","volume":"5","author":"S Herbold","year":"2020","unstructured":"Herbold, S.: Autorank: a python package for automated ranking of classifiers. J. Open Source Softw. 5(48), 2173 (2020)","journal-title":"J. Open Source Softw."},{"issue":"3","key":"791_CR27","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/a6030471","volume":"6","author":"Z Kir\u00e1ly","year":"2013","unstructured":"Kir\u00e1ly, Z.: Linear time local approximation algorithm for maximum stable marriage. Algorithms 6(3), 471\u2013484 (2013)","journal-title":"Algorithms"},{"issue":"12","key":"791_CR28","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.14778\/2994509.2994535","volume":"9","author":"P Konda","year":"2016","unstructured":"Konda, P., Das, S., Doan, A., Ardalan, A., Ballard, J.R., Li, H., Panahi, F., Zhang, H., Naughton, J.F., Prasad, S., Krishnan, G., Deep, R., Raghavendra, V.: Magellan: toward building entity matching management systems. Proc. VLDB Endow. 9(12), 1197\u20131208 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"791_CR29","doi-asserted-by":"publisher","first-page":"484","DOI":"10.14778\/1920841.1920904","volume":"3","author":"H K\u00f6pcke","year":"2010","unstructured":"K\u00f6pcke, H., Thor, A., Rahm, E.: Evaluation of entity resolution approaches on real-world match problems. Proc. VLDB Endow. 3(1), 484\u2013493 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"791_CR30","doi-asserted-by":"crossref","unstructured":"Kriege, N.M., Giscard, P., Bause, F., Wilson, R.C.: Computing optimal assignments in linear time for approximate graph matching. In: ICDM, pp. 349\u2013358 (2019)","DOI":"10.1109\/ICDM.2019.00045"},{"key":"791_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W., Yaw, B.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"791_CR32","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/321138.321140","volume":"9","author":"JM Kurtzberg","year":"1962","unstructured":"Kurtzberg, J.M.: On approximation methods for the assignment problem. J. ACM (JACM) 9(4), 419\u2013439 (1962)","journal-title":"J. ACM (JACM)"},{"key":"791_CR33","unstructured":"Kusner, M.J., Sun, Y., Kolkin, N.I., Weinberger, K.Q.: From word embeddings to document distances. In: ICML, vol. 37, pp. 957\u2013966 (2015)"},{"issue":"1","key":"791_CR34","doi-asserted-by":"publisher","first-page":"50","DOI":"10.14778\/3421424.3421431","volume":"14","author":"Y Li","year":"2020","unstructured":"Li, Y., Li, J., Suhara, Y., Doan, A., Tan, W.: Deep entity matching with pre-trained language models. Proc. VLDB Endow. 14(1), 50\u201360 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"791_CR35","first-page":"1:1","volume":"13","author":"Y Li","year":"2021","unstructured":"Li, Y., Li, J., Suhara, Y., Wang, J., Hirota, W.: Deep entity matching: challenges and opportunities. ACM J. Data Inf. Qual. 13(1), 1:1-1:17 (2021)","journal-title":"ACM J. Data Inf. Qual."},{"key":"791_CR36","doi-asserted-by":"crossref","unstructured":"Lovasz, L., Plummer, M.D.: Matching theory. vol 367, American MathematicalSoc (2009)","DOI":"10.1090\/chel\/367"},{"key":"791_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)"},{"key":"791_CR38","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: ICDE, pp. 117\u2013128 (2002)"},{"key":"791_CR39","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS, pp. 3111\u20133119 (2013)"},{"key":"791_CR40","doi-asserted-by":"crossref","unstructured":"Mudgal, S., Li, H., Rekatsinas, T., Doan, A., Park, Y., Krishnan, G., Deep, R., Arcaute, E., Raghavendra, V.: Deep learning for entity matching: a design space exploration. In: SIGMOD, pp. 19\u201334 (2018)","DOI":"10.1145\/3183713.3196926"},{"key":"791_CR41","volume-title":"Distribution-Free Multiple Comparisons","author":"P Nemenyi","year":"1963","unstructured":"Nemenyi, P.: Distribution-Free Multiple Comparisons. Princeton University, Princeton (1963)"},{"key":"791_CR42","unstructured":"Obraczka, D., Schuchart, J., Rahm, E.: EAGER: embedding-assisted entity resolution for knowledge graphs. CoRR. arXiv:2101.06126 (2021)"},{"key":"791_CR43","doi-asserted-by":"publisher","unstructured":"Otto, B., Reichert, A.: Organizing master data management: findings from an expert survey. In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), pp. 106\u2013110 (2010). https:\/\/doi.org\/10.1145\/1774088.1774111","DOI":"10.1145\/1774088.1774111"},{"issue":"5","key":"791_CR44","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1007\/s11280-015-0365-x","volume":"19","author":"G Papadakis","year":"2016","unstructured":"Papadakis, G., Giannakopoulos, G., Paliouras, G.: Graph vs. bag representation models for the topic classification of web documents. World Wide Web 19(5), 887\u2013920 (2016)","journal-title":"World Wide Web"},{"key":"791_CR45","doi-asserted-by":"crossref","unstructured":"Papadakis, G., Ioannou, E., Nieder\u00e9e, C., Fankhauser, P.: Efficient entity resolution for large heterogeneous information spaces. In: WSDM, pp. 535\u2013544 (2011)","DOI":"10.1145\/1935826.1935903"},{"key":"791_CR46","doi-asserted-by":"crossref","unstructured":"Papadakis, G., Ioannou, E., Thanos, E., Palpanas, T.: The Four Generations of Entity Resolution. Synthesis Lectures on Data Management. Morgan and Claypool Publishers, San Rafael (2021)","DOI":"10.1007\/978-3-031-01878-7"},{"issue":"8","key":"791_CR47","doi-asserted-by":"publisher","first-page":"1946","DOI":"10.1109\/TKDE.2013.54","volume":"26","author":"G Papadakis","year":"2014","unstructured":"Papadakis, G., Koutrika, G., Palpanas, T., Nejdl, W.: Meta-blocking: taking entity resolution to the next level. IEEE Trans. Knowl. Data Eng. 26(8), 1946\u20131960 (2014). https:\/\/doi.org\/10.1109\/TKDE.2013.54","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"791_CR48","doi-asserted-by":"crossref","unstructured":"Papadakis, G., Mandilaras, G.M., Gagliardelli, L., Simonini, G., Thanos, E., Giannakopoulos, G., Bergamaschi, S., Palpanas, T., Koubarakis, M.: Three-dimensional entity resolution with JedAI. Inf. Syst. 93, 101\u2013565 (2020)","DOI":"10.1016\/j.is.2020.101565"},{"key":"791_CR49","doi-asserted-by":"crossref","unstructured":"Papadakis, G., Papastefanatos, G., Koutrika, G.: Supervised meta-blocking. Proc. VLDB Endow. 7(14), 1929\u20131940 (2014)","DOI":"10.14778\/2733085.2733098"},{"issue":"2","key":"791_CR50","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/3377455","volume":"53","author":"G Papadakis","year":"2020","unstructured":"Papadakis, G., Skoutas, D., Thanos, E.: Blocking and filtering techniques for entity resolution: a survey. ACM Comput. Surv. 53(2), 31:1-31:42 (2020). https:\/\/doi.org\/10.1145\/3377455","journal-title":"ACM Comput. Surv."},{"key":"791_CR51","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.D.: Glove: global vectors for word representation. In: EMNLP, pp. 1532\u20131543 (2014)","DOI":"10.3115\/v1\/D14-1162"},{"issue":"140","key":"791_CR52","first-page":"1","volume":"21","author":"C Raffel","year":"2020","unstructured":"Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., Liu, P.J.: Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res. 21(140), 1\u201367 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"791_CR53","doi-asserted-by":"publisher","unstructured":"Reas, R., Ash, S., Barton, R., Borthwick, A.: Superpart: supervised graph partitioning for record linkage. In: IEEE International Conference on Data Mining, ICDM 2018, Singapore, November 17\u201320, 2018, pp. 387\u2013396. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/ICDM.2018.00054","DOI":"10.1109\/ICDM.2018.00054"},{"issue":"1","key":"791_CR54","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF00532240","volume":"70","author":"L R\u00fcschendorf","year":"1985","unstructured":"R\u00fcschendorf, L.: The Wasserstein distance and approximation theorems. Probab. Theory Relat. Fields 70(1), 117\u2013129 (1985)","journal-title":"Probab. Theory Relat. Fields"},{"key":"791_CR55","doi-asserted-by":"publisher","first-page":"61","DOI":"10.7250\/csimq.2018-16.04","volume":"16","author":"A Saeedi","year":"2018","unstructured":"Saeedi, A., Nentwig, M., Peukert, E., Rahm, E.: Scalable matching and clustering of entities with FAMER. Complex Syst. Inform. Model. Q. 16, 61\u201383 (2018)","journal-title":"Complex Syst. Inform. Model. Q."},{"key":"791_CR56","doi-asserted-by":"crossref","unstructured":"Saeedi, A., Peukert, E., Rahm, E.: Using link features for entity clustering in knowledge graphs. In: ESWC, Lecture Notes in Computer Science, vol. 10843, pp. 576\u2013592. Springer (2018)","DOI":"10.1007\/978-3-319-93417-4_37"},{"key":"791_CR57","doi-asserted-by":"crossref","unstructured":"Schwartz, J., Steger, A., Wei\u00dfl, A.: Fast algorithms for weighted bipartite matching. In: WEA, Lecture Notes in Computer Science, vol. 3503, pp. 476\u2013487 (2005)","DOI":"10.1007\/11427186_41"},{"key":"791_CR58","doi-asserted-by":"crossref","unstructured":"Wang, Y., Tong, Y., Long, C., Xu, P., Xu, K., Lv, W.: Adaptive dynamic bipartite graph matching: a reinforcement learning approach. In: ICDE, pp. 1478\u20131489 (2019)","DOI":"10.1109\/ICDE.2019.00133"},{"key":"791_CR59","doi-asserted-by":"crossref","unstructured":"Wang, Z., Sisman, B., Wei, H., Dong, X.L., Ji, S.: Cordel: a contrastive deep learning approach for entity linkage. In: ICDM (2020)","DOI":"10.1109\/ICDM50108.2020.00171"},{"key":"791_CR60","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Technical note q-learning. Mach. Learn. 8, 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"791_CR61","doi-asserted-by":"crossref","unstructured":"Wijaya, D.T., Bressan, S.: Ricochet: a family of unconstrained algorithms for graph clustering. In: International Conference on Database Systems for Advanced Applications, pp. 153\u2013167. Springer (2009)","DOI":"10.1007\/978-3-642-00887-0_13"},{"key":"791_CR62","unstructured":"Winkler, W.E.: Overview of record linkage and current research directions. Technical Report, Bureau of the Census (2006)"},{"key":"791_CR63","doi-asserted-by":"crossref","unstructured":"Wu, R., Chaba, S., Sawlani, S., Chu, X., Thirumuruganathan, S.: Zeroer: entity resolution using zero labeled examples. In: SIGMOD, pp. 1149\u20131164 (2020)","DOI":"10.1145\/3318464.3389743"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00791-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00791-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00791-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T10:08:35Z","timestamp":1697796515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00791-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,18]]},"references-count":63,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["791"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00791-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,18]]},"assertion":[{"value":"29 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}