{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:02:53Z","timestamp":1774551773360,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673086"],"award-info":[{"award-number":["61673086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005408","name":"Science Promotion Program of University of Electronic Science and Technology of China (UESTC), China","doi-asserted-by":"publisher","award":["Y03111023901014006"],"award-info":[{"award-number":["Y03111023901014006"]}],"id":[{"id":"10.13039\/501100005408","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3073249","type":"journal-article","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T23:02:42Z","timestamp":1618441362000},"page":"57874-57885","source":"Crossref","is-referenced-by-count":6,"title":["SSNE: Effective Node Representation for Link Prediction in Sparse Networks"],"prefix":"10.1109","volume":"9","author":[{"given":"Ming-Ren","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1076-3469","authenticated-orcid":false,"given":"Ping","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2089-5150","authenticated-orcid":false,"given":"Shi-Min","family":"Cai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of ‘small-world’ networks","volume":"393","author":"watts","year":"1998","journal-title":"Nature"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.121319"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/122\/68003"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref36","article-title":"What if CLIQUE were fast? Maximum cliques in information networks and strong components in temporal networks","author":"rossi","year":"2012","journal-title":"arXiv 1210 5802"},{"key":"ref35","first-page":"47","article-title":"Pajek–program for large network analysis","volume":"21","author":"batagelj","year":"1998","journal-title":"Connections"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref16","article-title":"From one point to a manifold: Knowledge graph embedding for precise link prediction","author":"xiao","year":"2015","journal-title":"arXiv 1512 04792"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1063\/1.5120724"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"790","DOI":"10.3390\/rs9080790","article-title":"Local geometric structure feature for dimensionality reduction of hyperspectral imagery","volume":"9","author":"luo","year":"2017","journal-title":"Remote Sens"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186102"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-018-2867-7"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","article-title":"Link mining: A survey","volume":"7","author":"lise","year":"2005","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2014.07.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835837"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1142\/S0217979218501977"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3012704"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"l\u00fc","year":"2011","journal-title":"Phys A Stat Mech Appl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nrn2575"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-017-9590-2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186113"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2019.2944970"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18590-9_45"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2766758"},{"key":"ref41","first-page":"261","author":"l\u00fc","year":"0","journal-title":"Link prediction Appendix A 1 the selection of N in calculating AUC"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref26","first-page":"2568","article-title":"Predicting user’s multi-interests with network embedding in health-related topics","author":"jin","year":"2016","journal-title":"Proc Int Joint Conf Neural Netw (IJCNN)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73198-8_9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/cells8111405"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09404161.pdf?arnumber=9404161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:48:35Z","timestamp":1643222915000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9404161\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3073249","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}