{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:55Z","timestamp":1740169195953,"version":"3.37.3"},"reference-count":34,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3037656","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T21:16:33Z","timestamp":1605215793000},"page":"205170-205180","source":"Crossref","is-referenced-by-count":0,"title":["Task-Guided Context-Path Embedding in Temporal Heterogeneous Networks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4675-648X","authenticated-orcid":false,"given":"Qian","family":"Hu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2530-859X","authenticated-orcid":false,"given":"Fan","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2846-5411","authenticated-orcid":false,"given":"Beizhan","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3014-3363","authenticated-orcid":false,"given":"Chunyan","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220054"},{"journal-title":"Algorithms in C Part 5 Graph Algorithms","year":"2001","author":"sedgewick","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2903712"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125601"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/58.1.83"},{"key":"ref10","first-page":"592","article-title":"SHINE: Signed heterogeneous information network embedding for sentiment link prediction","author":"wang","year":"2017","journal-title":"Proceedings of the 1th ACM International Conference on Web Search and Data Mining"},{"key":"ref11","article-title":"Heterogeneous information network embedding for meta path based proximity","author":"huang","year":"2017","journal-title":"arXiv 1701 05291"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116869"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891513"},{"key":"ref14","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"CoRR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783307"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"key":"ref19","article-title":"Models for capturing temporal smoothness in evolving networks for learning latent representation of nodes","author":"saha","year":"2018","journal-title":"arXiv 1804 05816"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.05.050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"ref27","first-page":"1027","article-title":"K-Means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.118701"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020603"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2899366"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018735"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132953"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"ref2","article-title":"Temporal motifs in heterogeneous information networks","author":"li","year":"2018","journal-title":"KDD MLG Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014221"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref20","article-title":"DyLink2Vec: Effective feature representation for link prediction in dynamic networks","author":"rahman","year":"2018","journal-title":"arXiv 1804 05755"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623756"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"ref24","first-page":"437","article-title":"Are meta-paths necessary? Revisiting heterogeneous graph embeddings","author":"hussein","year":"2018","journal-title":"Proc ACM Int Conf Inf Knowl Manag"},{"key":"ref23","article-title":"Heterogeneous network representation learning: Survey, benchmark, evaluation, and beyond","author":"yang","year":"2020","journal-title":"arXiv 2004 00216"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref25","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume":"2","author":"mikolov","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09257448.pdf?arnumber=9257448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:54:56Z","timestamp":1639770896000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9257448\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3037656","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}