Volume 36, Issue 3 (Spring 2021)                   ... 2021, 36(3): 791-816 | Back to browse issues page

XML Persian Abstract Print


Regional Information Center for Science and Technology; Islamic World Science Citation Center; Shiraz, Iran
Abstract:   (762 Views)
In the recent years, with the increasing volume of articles and the use of Internet and search engine services, the author name disambiguation problem has received a lot of attention. Name disambiguation can occur when one is seeking a list of publications of an author who has used different name variations and also when there are multiple other authors with the same name. So far, various methods have been proposed to solve this problem, each of which has its own advantages and disadvantages. Despite years of research, the name disambiguation problem remains largely unresolved. In this study, we propose an algorithm to identify several records that belong to one author. For this purpose, a new criterion has been proposed to determine the similarity between the two records. Since this study addresses the approximate matching of authors’ records, the importance of the fields in each record is determined by the coefficients. In order to get the optimal coefficients, we propose a genetic algorithm to learn from the available samples. The proposed method has been evaluated with two fitness functions on experimental data and the results are promising.
Full-Text [PDF 922 kb]   (271 Downloads)    
Type of Study: Research | Subject: Information Storage and Retrieval
Received: 2020/04/19 | Accepted: 2020/10/7 | Published: 2021/04/5

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.