{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:50:44Z","timestamp":1764960644886,"version":"3.46.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272237"],"award-info":[{"award-number":["62272237"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tnsm.2025.3601389","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:30:15Z","timestamp":1755801015000},"page":"5211-5222","source":"Crossref","is-referenced-by-count":0,"title":["Deep Learning-Based Link Prediction Method Against Strong Sparsity for Mobile Social Networks"],"prefix":"10.1109","volume":"22","author":[{"given":"Yadi","family":"He","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0567-2645","authenticated-orcid":false,"given":"Zhou","family":"Wu","sequence":"additional","affiliation":[{"name":"Faculty of Data Science, City University of Macau, Macau, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0824-6203","authenticated-orcid":false,"given":"Linfeng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2951806"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14257\/ijgdc.2016.9.2.05"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102716"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2962819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2019.00535"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2017.2764479"},{"key":"ref7","first-page":"1310","article-title":"On the difficulty of training recurrent neural networks","volume-title":"Proc. 30th Int. Conf. Mach. Learn. (PMLR)","author":"Pascanu"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCNT51525.2021.9580032"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v13i01.3247"},{"key":"ref10","article-title":"Adversarially regularized graph autoencoder for graph embedding","author":"Pan","year":"2019","journal-title":"arXiv:1802.04407v2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3168010"},{"key":"ref14","first-page":"73000","article-title":"Pure message passing can estimate common neighbor for link prediction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"37","author":"Dong"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0673"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3612931"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-50371-0_42"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2932913"},{"issue":"3","key":"ref19","first-page":"707","article-title":"A link prediction method based on gated recurrent units for mobile social network","volume":"60","author":"Liu","year":"2023","journal-title":"J. Comput. Res. Develop."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.05.079"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WACV57701.2024.00246"},{"key":"ref22","article-title":"TimesNet: Temporal 2D-variation modeling for general time series analysis","author":"Wu","year":"2023","journal-title":"arXiv:2210.02186v3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2020.103378"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2024.114177"},{"key":"ref25","article-title":"Adadelta: An adaptive learning rate method","author":"Zeiler","year":"2012","journal-title":"arXiv:1212.5701"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICECA55336.2022.10009496"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"volume-title":"The KONECT project","year":"2024","author":"Kunegis","key":"ref28"},{"key":"ref29","first-page":"601","article-title":"Motifs in temporal networks","volume-title":"Proc. 10th ACM Int. Conf. Web Search Data Min.","author":"Ashwin"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106168"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1063\/1.5107440"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4275028\/11278396\/11133455.pdf?arnumber=11133455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:38:33Z","timestamp":1764959913000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11133455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2025.3601389","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"type":"electronic","value":"1932-4537"},{"type":"electronic","value":"2373-7379"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}