{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:44Z","timestamp":1740169124679,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018YFB2101100"],"award-info":[{"award-number":["2018YFB2101100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932001","61602500","61972409","61502500","61702529","61702530"],"award-info":[{"award-number":["61932001","61602500","61972409","61502500","61702529","61702530"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2942477","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T19:56:18Z","timestamp":1568922978000},"page":"135539-135555","source":"Crossref","is-referenced-by-count":5,"title":["Diting: An Author Disambiguation Method Based on Network Representation Learning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1202-9583","authenticated-orcid":false,"given":"Liwen","family":"Peng","sequence":"first","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siqi","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[{"name":"Ant Financial Services Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongquan","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele Lu","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Information and Electrical Engineering, China Agricultural University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref38","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"macqueen","year":"1965","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","article-title":"PathSim: Meta path-based top-K similarity search in heterogeneous information networks","volume":"4","author":"sun","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"ref31","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc NIPS"},{"key":"ref30","first-page":"1","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00069"},{"journal-title":"Natural Language Processing With Python","year":"2009","author":"bird","key":"ref36"},{"key":"ref35","first-page":"426","article-title":"Structural deep embedding for hyper-networks","author":"tu","year":"2018","journal-title":"Proc AAAI"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"ref28","first-page":"2167","article-title":"Adversarial network embedding","author":"dai","year":"2018","journal-title":"Proc AAAI"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1073\/pnas.1716322115","article-title":"Graphgan: Graph representation learning with generative adversarial nets","author":"wang","year":"2018","journal-title":"Proc AAAI"},{"key":"ref29","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.13"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767835"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"ref24","first-page":"282","article-title":"Representation learning for scale-free networks","author":"feng","year":"2018","journal-title":"Proc AAAI"},{"key":"ref23","first-page":"3889","article-title":"Max-margin deepwalk: Discriminative learning of network representation","author":"tu","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref26","first-page":"2127","article-title":"Harp: Hierarchical representation learning for networks","author":"chen","year":"2018","journal-title":"Proc AAAI"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/544"},{"key":"ref50","first-page":"11","article-title":"Learning distance functions using equivalence relations","author":"bar-hillel","year":"2003","journal-title":"Proc ICML"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015360"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368983"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983714"},{"key":"ref40","first-page":"265","article-title":"Quality scheme assessment in the clustering process","author":"halkidi","year":"2000","journal-title":"Proc PKDD"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269272"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321600"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1045\/september2013-imran"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref16","article-title":"Incorporating deep features in the analysis of tissue microarray images","author":"yan","year":"2018","journal-title":"arXiv 1812 00887"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref18","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref4","first-page":"169","article-title":"A novel approach for author name disambiguation using ranking confidence","author":"lin","year":"2017","journal-title":"Proc DSFAA"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132873"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/996350.996419"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2517288.2517295"},{"key":"ref8","first-page":"160","article-title":"Density-based clustering based on hierarchical density estimates","author":"campello","year":"2013","journal-title":"Proc PAKDD"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.19"},{"key":"ref49","first-page":"521","article-title":"Distance metric learning with application to clustering with side-information","author":"xing","year":"2002","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132953"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814572"},{"key":"ref47","first-page":"727","article-title":"X-means: Extending k-means with efficient estimation of the number of clusters","volume":"1","author":"dan","year":"2000","journal-title":"Proc ICML"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2756406.2756915","article-title":"Online person name disambiguation with constraints","author":"khabsa","year":"2015","journal-title":"Proc JCDL"},{"key":"ref41","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","volume":"1","author":"wagstaff","year":"2001","journal-title":"Proc 18th Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1158"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-015-9261-3"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08844683.pdf?arnumber=8844683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:08:26Z","timestamp":1662667706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8844683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2942477","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}