{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:56:54Z","timestamp":1777733814177,"version":"3.51.4"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100007128","name":"Shaanxi Provincial Natural Science Foundation Project","doi-asserted-by":"publisher","award":["2020JM533"],"award-info":[{"award-number":["2020JM533"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"Chinese Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2020M673446"],"award-info":[{"award-number":["2020M673446"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3045529","type":"journal-article","created":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T20:44:37Z","timestamp":1608237877000},"page":"226773-226783","source":"Crossref","is-referenced-by-count":7,"title":["Link Prediction Based on Orbit Counting and Graph Auto-Encoder"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1154-3695","authenticated-orcid":false,"given":"Jian","family":"Feng","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Xian University of Science and Technology, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7957-7707","authenticated-orcid":false,"given":"Shaojian","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Xian University of Science and Technology, Xi’an, China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc ICLR"},{"key":"ref11","first-page":"5171","article-title":"Link prediction based on graph neural networks","author":"zhang","year":"2018","journal-title":"Proc NIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref13","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"arXiv 1611 07308"},{"key":"ref14","first-page":"1","article-title":"Computation of graphlet orbits for nodes and edges in sparse graphs","volume":"71","author":"ho?evar","year":"2016","journal-title":"J Stat Softw"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/58007"},{"key":"ref16","first-page":"1261","article-title":"Motif-preserving network representation learning","volume":"13","author":"xu","year":"2018","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"ref17","first-page":"412","article-title":"Link prediction via higher-order motif features","author":"abuoda","year":"2019","journal-title":"Proc ECML PKDD"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186900"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3006475"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-017-1460-z"},{"key":"ref27","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc AAAI"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/592"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412096"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.125154"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330850"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"ref21","first-page":"2803","article-title":"Link prediction via subgraph embedding-based convex matrix completion","author":"cao","year":"2018","journal-title":"Proc AAAI"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00047-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2878247"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/110859798"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09296751.pdf?arnumber=9296751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:13:26Z","timestamp":1662668006000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9296751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3045529","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}