{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:15:03Z","timestamp":1760080503459,"version":"3.37.3"},"reference-count":22,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["FRF-TP-19-045A1"],"award-info":[{"award-number":["FRF-TP-19-045A1"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2021,5,8]]},"abstract":"<jats:p>Recently, massive online academic resources have provided convenience for scientific study and research. However, the author name ambiguity degrades the user experience in retrieving the literature bases. Extracting the features of papers and calculating the similarity for clustering constitute the mainstream of present name disambiguation approaches, which can be divided into two branches: clustering based on attribute features and clustering based on linkage information. They cannot however get high performance. In order to improve the efficiency of literature retrieval and provide technical support for the accurate construction of literature bases, a name disambiguation method based on Graph Convolutional Network (GCN) is proposed. The disambiguation model based on GCN designed in this paper combines both attribute features and linkage information. We first build paper-to-paper graphs, coauthor graphs, and paper-to-author graphs for each reference item of a name. The nodes in the graphs contain attribute features and the edges contain linkage features. The graphs are then fed to a specialized GCN and output a hybrid representation. Finally, we use the hierarchical clustering algorithm to divide the papers into disjoint clusters. Finally, we cluster the papers using a hierarchical algorithm. The experimental results show that the proposed model achieves average F1 value of 77.10% on three name disambiguation datasets. In order to let the model automatically select the appropriate number of convolution layers and adapt to the structure of different local graphs, we improve upon the prior GCN model by utilizing attention mechanism. Compared with the original GCN model, it increases the average precision and F1 value by 2.05% and 0.63%, respectively. What is more, we build a bilingual dataset, BAT, which contains various forms of academic achievements and will be an alternative in future research of name disambiguation.<\/jats:p>","DOI":"10.1155\/2021\/5577692","type":"journal-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T18:35:14Z","timestamp":1620671714000},"page":"1-11","source":"Crossref","is-referenced-by-count":6,"title":["Name Disambiguation Based on Graph Convolutional Network"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5721-792X","authenticated-orcid":true,"given":"Ya","family":"Chen","sequence":"first","affiliation":[{"name":"University of Science and Technology Beijing, Beijing 100083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2715-4870","authenticated-orcid":true,"given":"Hongliang","family":"Yuan","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing 100191, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5903-7065","authenticated-orcid":true,"given":"Tingting","family":"Liu","sequence":"additional","affiliation":[{"name":"China Association for Science and Technology, Beijing 100081, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4876-6553","authenticated-orcid":true,"given":"Nan","family":"Ding","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing 100191, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"author":"R. Bunescu","article-title":"Using encyclopedic knowledge for named entity disambiguation","key":"1"},{"author":"X. Han","first-page":"765","article-title":"Collective entity linking in web text: a graph-based method","key":"2"},{"issue":"4","key":"3","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.joi.2013.06.006","article-title":"Accuracy of simple, initials-based methods for author name disambiguation","volume":"7","author":"S. Milojevic","year":"2013","journal-title":"Journal of Informetrics"},{"author":"H. Han","first-page":"296","article-title":"Two supervised learning approaches for name disambiguation in author citations","key":"4"},{"author":"B. Zhang","first-page":"1341","article-title":"Bayesian non-exhaustive classification A case study: online name disambiguation using temporal record streams","key":"5"},{"author":"B. Amit","first-page":"79","article-title":"Entity-based cross-document coreferencing using the vector space model","key":"6"},{"author":"G. S. Mann","first-page":"33","article-title":"Unsupervised personal name disambiguation","key":"7"},{"key":"8","first-page":"190","article-title":"Towards robust unsupervised personal name disambiguation","volume":"80","author":"Y. Chen","year":"2007","journal-title":"Empirical Methods in Natural Language Processing"},{"author":"H. Han","first-page":"334","article-title":"Name disambiguation in author citations using A K-way spectral clustering method","key":"9"},{"volume-title":"Research on Disambiguation of Authors with the Same Name in Literature Database","year":"2019","author":"W. Zhang","key":"10"},{"author":"D. Zhang","first-page":"1019","article-title":"A constraint-based probabilistic framework for name disambiguation","key":"11"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/tkde.2011.13"},{"author":"Y. Song","first-page":"342","article-title":"Efficient topic-based unsupervised name disambiguation","key":"13"},{"key":"14","first-page":"1002","article-title":"Name disambiguation in AMiner: clustering, maintenance, and human in the loop","volume":"18","author":"Y. Zhang","year":"2018","journal-title":"Knowledge Discovery and Data Mining"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1007\/978-3-030-34223-4_34"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1007\/s11192-014-1381-9"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1145\/1891879.1891883"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/access.2019.2942477"},{"author":"V. Franzoni","first-page":"239","article-title":"Efficient graph-based author disambiguation by topological similarity in DBLP","key":"19"},{"author":"L. Peng","first-page":"1","article-title":"Author disambiguation through adversarial network representation learning","key":"20"},{"year":"2013","author":"T. Mikolov","article-title":"Efficient estimation of word representations in vector space","key":"21"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1016\/j.ins.2018.02.047"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/5577692.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/5577692.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/5577692.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T18:35:27Z","timestamp":1620671727000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2021\/5577692\/"}},"subtitle":[],"editor":[{"given":"Pengwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,5,8]]},"references-count":22,"alternative-id":["5577692","5577692"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5577692","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"type":"electronic","value":"1875-919X"},{"type":"print","value":"1058-9244"}],"subject":[],"published":{"date-parts":[[2021,5,8]]}}}