Author
Listed:
- David Muñoz-Jordán
(Universidad de Zaragoza)
- Gonzalo Ruiz
(Universidad de Zaragoza
Kampal Data Solutions, S.L.)
- Pablo Cabriada
(Kampal Data Solutions, S.L.)
- Juan Luis Durán
(Kampal Data Solutions, S.L.)
- David Iñiguez
(Universidad de Zaragoza
Kampal Data Solutions, S.L.
Fundación ARAID, Gobierno de Aragón)
- Alejandro Rivero
(Universidad de Zaragoza
Kampal Data Solutions, S.L.)
Abstract
When researchers sign an article, they reference all the institutions they belong to, writing one or more affiliations containing them. Researchers sign in many different ways, and different journals also have varying standards in this regard. In this article we will focus on the Institution Name Disambiguation (IND) problem, also known as Organization Name Disambiguation (OND). Common issues associated to IND problem arise because researchers may write the name of the institution differently in various publications, and different researchers from the same institution will certainly write it differently as well. On the other hand, a researcher may be affiliated with several centers simultaneously or at different stages of their professional life, which introduces the factor of time as an additional variable to consider. As a result, analyzing and linking scientific work from different areas for various institutions is challenging. Databases like Web of Science collect articles from various journals across different fields. In this article, we will propose a method named 3 Steps Affiliation (3SA) based on, firstly, preprocessing the information, secondly, candidate extraction via localization and classification type of the institutions and, thirdly, on entity linking to extract the institutions from affiliations downloaded from Web of Science articles using an edit distance. We use a world-wide open source database with more than 100k institutions to solve the Institution Name Disambiguation problem. We show that the proposed method has a state-of-art performance by comparing it with other methods. Additionally, we evaluate the impact of different edit distance metrics within our method to identify which yields the best results.
Suggested Citation
David Muñoz-Jordán & Gonzalo Ruiz & Pablo Cabriada & Juan Luis Durán & David Iñiguez & Alejandro Rivero, 2025.
"3SA: an entity-linking algorithm for the Institution Name Disambiguation problem in affiliations using edit distance,"
Scientometrics, Springer;Akadémiai Kiadó, vol. 130(7), pages 4073-4091, July.
Handle:
RePEc:spr:scient:v:130:y:2025:i:7:d:10.1007_s11192-025-05368-1
DOI: 10.1007/s11192-025-05368-1
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:scient:v:130:y:2025:i:7:d:10.1007_s11192-025-05368-1. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.