Author Classification on Bibliographic Data Using Capsule Networks Architecture

firdaus, firdaus (2022) Author Classification on Bibliographic Data Using Capsule Networks Architecture. International Conference on Electrical Engineering, Computer Science and Informatics (EECSI), 2022-O. pp. 101-105. ISSN 978-1-5386-0549-3

[thumbnail of 27.pdf] Text
27.pdf - Published Version

Download (397kB)

Abstract

The problem with Author Name Disambiguation is to determine whether the same name in the bibliographic archive refers to the same author or not. Currently, author identification on The Labeled Digital Bibliography and Library Project (DBLP) is triggered by a request for an author who finds his publication mixed with other peoples writing. Name ambiguity leads to incorrect identification and attribution of credit to authors. Despite much research in the last decade, the issue of ambiguity of the authors name remains largely unsolved. In this paper, the Capsule Networks (CapsNets) method is proposed to resolve the ambiguity of the authors name. The proposed method obtains the best accuracy in four Name Disambiguation problems including homonyms, synonyms, and non-homonyms synonyms, which is an average of 99% on training and testing data. Likewise, the overall data tested has an accuracy of 99.83% with a low error value. In addition, CapsNets were tested with Performance Measurements including Sensitivity, Precision, and F1-Score. Capsnets can identify authors in DBLP bibliographic data by using a number of attributes such as author name, co-Author, venue, title, and year. © 2022 Institute of Advanced Engineering and Science (IAES).

Item Type: Article
Subjects: Q Science > Q Science (General) > Q334-342 Computer science. Artificial intelligence. Algorithms. Robotics. Automation.
Divisions: 09-Faculty of Computer Science > 56201-Computer Systems (S1)
Depositing User: Mr Firdaus Firdaus
Date Deposited: 17 Mar 2023 15:09
Last Modified: 17 Mar 2023 15:09
URI: http://repository.unsri.ac.id/id/eprint/90710

Actions (login required)

View Item View Item