{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:17Z","timestamp":1740169097599,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2017MG022"],"award-info":[{"award-number":["ZR2017MG022"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71672103","61572104","71501113"],"award-info":[{"award-number":["71672103","61572104","71501113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tianjin Science and Technology Development Strategic Planning Research Program","award":["17ZLZDZF00240"],"award-info":[{"award-number":["17ZLZDZF00240"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2912662","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:41:02Z","timestamp":1556228462000},"page":"54133-54143","source":"Crossref","is-referenced-by-count":5,"title":["Link Prediction in Online Social Networks Based on the Unsupervised Marginalized Denoising Model"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2145-4920","authenticated-orcid":false,"given":"Zhangang","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"41","article-title":"Link prediction in social networks based on hypergraph","author":"li","year":"2016"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0148265"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2594455"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42042-9_53"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32597-7_30"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835855"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.08.135"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.10.011"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.07.018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11227-5_4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46248-5_8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"ref2","first-page":"801","article-title":"Social circle-based algorithm for friend recommendation in online social networks","volume":"37","author":"yu","year":"2014","journal-title":"Chin J Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-014-5237-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553447"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2008.4761444"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/int.21601"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2013.05.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2659480.2659499"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2014.01.003"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.91.012801"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aaf775"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0090-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124378"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.10.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187973"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0128-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0142-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/101\/18004"},{"key":"ref17","first-page":"719","article-title":"Max-margin nonparametric latent feature models for link prediction","author":"zhu","year":"2012","journal-title":"Proc ICML"},{"key":"ref18","first-page":"1007","article-title":"Random function priors for exchangeable arrays with applications to graphs and relational data","author":"lloyd","year":"2012","journal-title":"Proc NIPS"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339730"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1460563.1460674"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89447-6_7"},{"key":"ref5","first-page":"42","article-title":"Finding experts by link prediction in co-authorship networks","author":"pavlov","year":"2007","journal-title":"Proc 2nd Int Conf Finding Experts Web Semantics"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/1502650.1502664","article-title":"Do you know?: Recommending people to invite into your social network","author":"guy","year":"2009","journal-title":"Proc 14th Int Conf Intell Interfaces"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772879"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2018.2829906"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-010-0006-4"},{"year":"2017","key":"ref46"},{"key":"ref45","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"mcauley","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2772880"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2563425"},{"key":"ref42","first-page":"43","article-title":"A link prediction method based on learning automata in social networks","volume":"11","author":"sara","year":"2018","journal-title":"Journal of Computer and Robotics"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.03.001"},{"key":"ref44","first-page":"1","article-title":"Marginalized denoising autoenco-ders for domain adaptation","author":"chen","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","first-page":"1","article-title":"Modeling homophily and stochastic equivalence in symmetric relational data","author":"hoff","year":"2007","journal-title":"Proc NIPS"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08695687.pdf?arnumber=8695687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T22:17:23Z","timestamp":1663366643000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8695687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2912662","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}