{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T13:30:37Z","timestamp":1744896637149,"version":"3.37.3"},"reference-count":41,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876184","61502001"],"award-info":[{"award-number":["61876184","61502001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002729","name":"Anhui University","doi-asserted-by":"publisher","award":["J01006057"],"award-info":[{"award-number":["J01006057"]}],"id":[{"id":"10.13039\/501100002729","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&D Program of China","award":["2018YFC0832101"],"award-info":[{"award-number":["2018YFC0832101"]}]},{"name":"Anhui Sun Create Electronics Co., Ltd","award":["KD1809300321"],"award-info":[{"award-number":["KD1809300321"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2900920","type":"journal-article","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T14:56:38Z","timestamp":1550847398000},"page":"26507-26518","source":"Crossref","is-referenced-by-count":7,"title":["Multi-Path Relationship Preserved Social Network Embedding"],"prefix":"10.1109","volume":"7","author":[{"given":"Jianfeng","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6447-2053","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hefu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuyuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","volume":"9","author":"fan","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-4012"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.06.042"},{"key":"ref31","first-page":"742","article-title":"Learning efficient object detection models with knowledge distillation","author":"chen","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Variational graph auto-encoders","year":"2016","author":"kipf","key":"ref30"},{"key":"ref37","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref36","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref35","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/78.650093"},{"key":"ref10","first-page":"1895","article-title":"Tri-party deep network representation","author":"pan","year":"2016","journal-title":"Proc 25th Int Conf Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0111"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186114"},{"key":"ref12","first-page":"154","article-title":"Semantic proximity search on heterogeneous graph by proximity embedding","author":"liu","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"journal-title":"Meta-path guided embedding for similarity search in large-scale heterogeneous information networks","year":"2016","author":"shang","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498256"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052643"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557109"},{"key":"ref17","first-page":"1050","article-title":"Multidimensional scaling","volume":"46","author":"cox","year":"2001","journal-title":"J Roy Stat Soc"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/472"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783296"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819980"},{"key":"ref3","first-page":"4","article-title":"Visualizing social networks","volume":"1","author":"freeman","year":"2000","journal-title":"J Social Structure"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"journal-title":"A General Framework for Content-enhanced Network Representation Learning","year":"2016","author":"sun","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref20","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","author":"belkin","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"journal-title":"Efficient Estimation of Word Representations in Vector Space","year":"2013","author":"mikolov","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/544"},{"key":"ref41","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume":"9","author":"glorot","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"ref26","first-page":"731","article-title":"Label informed attributed network embedding","author":"hu","year":"2017","journal-title":"Proceedings of the International Conference on Web Search and Data Mining ACM"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219969"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08649580.pdf?arnumber=8649580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:54:12Z","timestamp":1641988452000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8649580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2900920","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}