Graph-based methods for Author Name Disambiguation: a survey
Scholarly knowledge graphs (SKG) are knowledge graphs representing research-related information, powering discovery and statistics about research impact and trends. Author name disambiguation (AND) is required to produce high-quality SKGs, as a disambiguated set of authors is fundamental to ensure a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2023-09-01
|
| Series: | PeerJ Computer Science |
| Subjects: | |
| Online Access: | https://peerj.com/articles/cs-1536.pdf |
| _version_ | 1797687181694730240 |
|---|---|
| author | Michele De Bonis Fabrizio Falchi Paolo Manghi |
| author_facet | Michele De Bonis Fabrizio Falchi Paolo Manghi |
| author_sort | Michele De Bonis |
| collection | DOAJ |
| description | Scholarly knowledge graphs (SKG) are knowledge graphs representing research-related information, powering discovery and statistics about research impact and trends. Author name disambiguation (AND) is required to produce high-quality SKGs, as a disambiguated set of authors is fundamental to ensure a coherent view of researchers’ activity. Various issues, such as homonymy, scarcity of contextual information, and cardinality of the SKG, make simple name string matching insufficient or computationally complex. Many AND deep learning methods have been developed, and interesting surveys exist in the literature, comparing the approaches in terms of techniques, complexity, performance, etc. However, none of them specifically addresses AND methods in the context of SKGs, where the entity-relationship structure can be exploited. In this paper, we discuss recent graph-based methods for AND, define a framework through which such methods can be confronted, and catalog the most popular datasets and benchmarks used to test such methods. Finally, we outline possible directions for future work on this topic. |
| first_indexed | 2024-03-12T01:14:33Z |
| format | Article |
| id | doaj.art-4b9ba358276d4b3680ee34decf4e6734 |
| institution | Directory Open Access Journal |
| issn | 2376-5992 |
| language | English |
| last_indexed | 2024-03-12T01:14:33Z |
| publishDate | 2023-09-01 |
| publisher | PeerJ Inc. |
| record_format | Article |
| series | PeerJ Computer Science |
| spelling | doaj.art-4b9ba358276d4b3680ee34decf4e67342023-09-13T15:05:08ZengPeerJ Inc.PeerJ Computer Science2376-59922023-09-019e153610.7717/peerj-cs.1536Graph-based methods for Author Name Disambiguation: a surveyMichele De Bonis0Fabrizio Falchi1Paolo Manghi2Istituto di Scienza e Tecnologie dell’Informazione ”A. Faedo” (ISTI), Consiglio Nazionale delle Ricerche (CNR), Pisa, ItalyIstituto di Scienza e Tecnologie dell’Informazione ”A. Faedo” (ISTI), Consiglio Nazionale delle Ricerche (CNR), Pisa, ItalyIstituto di Scienza e Tecnologie dell’Informazione ”A. Faedo” (ISTI), Consiglio Nazionale delle Ricerche (CNR), Pisa, ItalyScholarly knowledge graphs (SKG) are knowledge graphs representing research-related information, powering discovery and statistics about research impact and trends. Author name disambiguation (AND) is required to produce high-quality SKGs, as a disambiguated set of authors is fundamental to ensure a coherent view of researchers’ activity. Various issues, such as homonymy, scarcity of contextual information, and cardinality of the SKG, make simple name string matching insufficient or computationally complex. Many AND deep learning methods have been developed, and interesting surveys exist in the literature, comparing the approaches in terms of techniques, complexity, performance, etc. However, none of them specifically addresses AND methods in the context of SKGs, where the entity-relationship structure can be exploited. In this paper, we discuss recent graph-based methods for AND, define a framework through which such methods can be confronted, and catalog the most popular datasets and benchmarks used to test such methods. Finally, we outline possible directions for future work on this topic.https://peerj.com/articles/cs-1536.pdfDisambiguationDeduplicationAuthor name disambiguation |
| spellingShingle | Michele De Bonis Fabrizio Falchi Paolo Manghi Graph-based methods for Author Name Disambiguation: a survey PeerJ Computer Science Disambiguation Deduplication Author name disambiguation |
| title | Graph-based methods for Author Name Disambiguation: a survey |
| title_full | Graph-based methods for Author Name Disambiguation: a survey |
| title_fullStr | Graph-based methods for Author Name Disambiguation: a survey |
| title_full_unstemmed | Graph-based methods for Author Name Disambiguation: a survey |
| title_short | Graph-based methods for Author Name Disambiguation: a survey |
| title_sort | graph based methods for author name disambiguation a survey |
| topic | Disambiguation Deduplication Author name disambiguation |
| url | https://peerj.com/articles/cs-1536.pdf |
| work_keys_str_mv | AT micheledebonis graphbasedmethodsforauthornamedisambiguationasurvey AT fabriziofalchi graphbasedmethodsforauthornamedisambiguationasurvey AT paolomanghi graphbasedmethodsforauthornamedisambiguationasurvey |