{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:55Z","timestamp":1742912935532,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031438486"},{"type":"electronic","value":"9783031438493"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":264,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Unlabeled entity deduplication is a relevant task already studied in the recent literature. Most methods can be traced back to the following workflow: entity blocking phase, in-block pairwise comparisons between entities to draw similarity relations, closure of the resulting meshes to create groups of duplicate entities, and merging group entities to remove disambiguation. Such methods are effective but still not good enough whenever a very low false positive rate is required. In this paper, we present an approach for evaluating the correctness of \u201cgroups of duplicates\u201d, which can be used to measure the group\u2019s accuracy hence its likelihood of false-positiveness. Our novel approach is based on a Graph Neural Network that exploits and combines the concept of Graph Attention and Long Short Term Memory (LSTM). The accuracy of the proposed approach is verified in the context of Author Name Disambiguation applied to a curated dataset obtained as a subset of the OpenAIRE Graph that includes PubMed publications with at least one ORCID identifier.<\/jats:p>","DOI":"10.1007\/978-3-031-43849-3_18","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T21:01:25Z","timestamp":1695330085000},"page":"207-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Neural Network Approach for\u00a0Evaluating Correctness of\u00a0Groups of\u00a0Duplicates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2347-6012","authenticated-orcid":false,"given":"Michele","family":"De Bonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Minutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6258-5313","authenticated-orcid":false,"given":"Fabrizio","family":"Falchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7291-3210","authenticated-orcid":false,"given":"Paolo","family":"Manghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"issue":"4","key":"18_CR1","first-page":"409","volume":"54","author":"P Manghi","year":"2020","unstructured":"Manghi, P., Atzori, C., De Bonis, M., Bardi, A.: Entity deduplication in big data graphs for scholarly communication. Data Technol. Appl. 54(4), 409\u2013435 (2020)","journal-title":"Data Technol. Appl."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"He, Q., Li, Z., Zhang, X.: Data deduplication techniques. In: 2010 International Conference on Future Information Technology and Management Engineering, vol. 1, pp. 430\u2013433. IEEE (2010)","DOI":"10.1109\/FITME.2010.5656539"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Kolb, L., Thor, A., Rahm, E.: Dedoop: efficient deduplication with hadoop. Proc. VLDB Endow. 5(12), 1878\u20131881 (2012). https:\/\/doi.org\/10.14778\/2367502.2367527","DOI":"10.14778\/2367502.2367527"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-019-0069-y","volume":"6","author":"S Zhang","year":"2019","unstructured":"Zhang, S., Tong, H., Xu, J., Maciejewski, R.: Graph convolutional networks: a comprehensive review. Comput. Soc. Netw. 6(1), 1\u201323 (2019). https:\/\/doi.org\/10.1186\/s40649-019-0069-y","journal-title":"Comput. Soc. Netw."},{"key":"18_CR5","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"18_CR6","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)"},{"key":"18_CR7","first-page":"28877","volume":"34","author":"C Ying","year":"2021","unstructured":"Ying, C., et al.: Do transformers really perform badly for graph representation? Adv. Neural Inf. Process. Syst. 34, 28877\u201328888 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"18_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-35233-1_18","volume-title":"Metadata and Semantics Research","author":"P Manghi","year":"2012","unstructured":"Manghi, P., Houssos, N., Mikulicic, M., J\u00f6rg, B.: The data model of the OpenAIRE scientific communication e-infrastructure. In: Dodero, J.M., Palomo-Duarte, M., Karampiperis, P. (eds.) MTSR 2012. CCIS, vol. 343, pp. 168\u2013180. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35233-1_18"},{"key":"18_CR9","unstructured":"Manghi, P., et al.: The openaire research graph data model. Zenodo (2019)"},{"key":"18_CR10","unstructured":"Manghi, P., et al.: Openaire research graph dump (2022)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Firmani, D., Laura, L.: The (betweenness) centrality of critical nodes and network cores, pp. 90\u201395, July 2013","DOI":"10.1109\/IWCMC.2013.6583540"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9, 1735\u20131780 (1997)","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"18_CR13","unstructured":"Vichos, K., et al.: A preliminary assessment of the article deduplication algorithm used for the openaire research graph (2022)"},{"key":"18_CR14","unstructured":"Errica, F., Podda, M., Bacciu, D., Micheli, A.: A fair comparison of graph neural networks for graph classification. CoRR abs\/1912.09893 (2019). http:\/\/arxiv.org\/abs\/1912.09893"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Tsuda, K., Saigo, H.: Graph classification, pp. 337\u2013363. Springer, US, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_11","DOI":"10.1007\/978-1-4419-6045-0_11"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"De Bonis, M., Manghi, P., Atzori, C.: FDup: a framework for general-purpose and efficient entity deduplication of record collections. PeerJ. Comput. Sci. 8, e1058 (2022)","DOI":"10.7717\/peerj-cs.1058"},{"key":"18_CR17","unstructured":"Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3, 993\u20131022 (2003)"},{"key":"18_CR18","unstructured":"Scott, M.L., SCOTT, M.L.: Dewey Decimal Classification. Libraries Unlimited (1998)"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"De Bonis, M.: Deduplication groups evaluator data benchmark. https:\/\/doi.org\/10.5281\/zenodo.7997279, June 2023","DOI":"10.5281\/zenodo.7997279"},{"key":"18_CR20","unstructured":"Devlin, J., Chang, M., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. CoRR abs\/1810.04805 (2018). http:\/\/arxiv.org\/abs\/1810.04805"}],"container-title":["Lecture Notes in Computer Science","Linking Theory and Practice of Digital Libraries"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43849-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T17:20:50Z","timestamp":1730136050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43849-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031438486","9783031438493"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43849-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPDL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Digital Libraries","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zadar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpdl2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tpdl2023.dei.unipd.it\/","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":"69","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":"13","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":"17","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":"19% - 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","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":"2","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":"3 invited papers","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)"}}]}}