{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:46:07Z","timestamp":1768549567700,"version":"3.49.0"},"reference-count":23,"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":[{"name":"China National Defense Science and Technology Innovation Special Zone Project","award":["17-H863-01-ZT-003-204-03"],"award-info":[{"award-number":["17-H863-01-ZT-003-204-03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2938202","type":"journal-article","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T20:07:40Z","timestamp":1567109260000},"page":"122722-122729","source":"Crossref","is-referenced-by-count":15,"title":["Link Prediction Algorithms for Social Networks Based on Machine Learning and HARP"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8230-6297","authenticated-orcid":false,"given":"Hao","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lunwen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufan","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref11","first-page":"1","article-title":"Don&#x2019;t Walk, Skip!: Online learning of multi-scale network embeddings","volume":"24","author":"perozzi","year":"2017","journal-title":"Comput Sci"},{"key":"ref12","first-page":"88","article-title":"Representation learning on graphs: Methods and applications","volume":"3","author":"hamilton","year":"2017","journal-title":"Bull IEEE Comput Soc Tech Committee Data Eng"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1073-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622018500530"},{"key":"ref15","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume":"26","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","article-title":"word2vec Explained: Deriving Mikolov et al.&#x2019;s negative-sampling word-embedding method","volume":"2","author":"goldberg","year":"2014","journal-title":"arXiv 1402 3722"},{"key":"ref17","first-page":"1019","article-title":"An overview of gradient descent optimization algorithms","volume":"58","author":"ruder","year":"2016","journal-title":"Int J Numer Methods Eng"},{"key":"ref18","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"arXiv 1611 07308"},{"key":"ref19","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"Proc ICLR"},{"key":"ref4","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"airoldi","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-014-5237-y"},{"key":"ref6","first-page":"1","article-title":"Harp: Hierarchical representation learning for networks","author":"chen","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1337"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2180861.2180866"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"ref20","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010920819831"},{"key":"ref21","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2009.03.002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08819975.pdf?arnumber=8819975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:05Z","timestamp":1641987125000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8819975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2938202","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}