{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:21Z","timestamp":1740169101434,"version":"3.37.3"},"reference-count":57,"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"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"am","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":["61602097","61472064"],"award-info":[{"award-number":["61602097","61472064"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["III 1213038","CNS 1646107"],"award-info":[{"award-number":["III 1213038","CNS 1646107"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ONR","award":["N00014-14-10215"],"award-info":[{"award-number":["N00014-14-10215"]}]},{"name":"HERE","award":["30046005"],"award-info":[{"award-number":["30046005"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["ZYGX2015J072"],"award-info":[{"award-number":["ZYGX2015J072"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2890826","type":"journal-article","created":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T19:46:56Z","timestamp":1546544816000},"page":"8917-8930","source":"Crossref","is-referenced-by-count":4,"title":["Predicting Topic Participation by Jointly Learning User Intrinsic and Extrinsic Preference"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-8150","authenticated-orcid":false,"given":"Fan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunpeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052639"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741667"},{"key":"ref33","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"ref31","first-page":"2177","article-title":"Neural word embedding as implicit matrix factorization","author":"levy","year":"2014","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref30","first-page":"52","article-title":"Representation learning on graphs: Methods and applications","volume":"40","author":"hamilton","year":"2017","journal-title":"IEEE Data Eng Bull"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1158"},{"key":"ref35","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"chen","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref34","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2009.0169"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2196\/publichealth.6313"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/427"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035952"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052643"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052647"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3199670"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref57","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767738"},{"key":"ref55","first-page":"2111","article-title":"Network representation learning with rich text information","author":"yang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1980.10486199"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.66"},{"key":"ref52","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","author":"shrivastava","year":"2014","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2382438.2382445"},{"key":"ref11","first-page":"2640","article-title":"Rating-boosted latent topics: Understanding users and items with ratings and reviews","author":"tan","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186067"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348372"},{"key":"ref14","first-page":"516","article-title":"Tweet recommendation with graph co-ranking","author":"yan","year":"2012","journal-title":"Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (ACL)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498225"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3072606"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2313872"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052626"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484057"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/416"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080791"},{"journal-title":"Efficient Estimation of Word Representations in Vector Space","year":"2013","author":"mikolov","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052718"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398492"},{"key":"ref7","first-page":"1","article-title":"Understanding black-box predictions via influence functions","author":"koh","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"article-title":"Variational graph auto-encoders","year":"2016","author":"kipf","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.188"},{"key":"ref46","first-page":"1188","article-title":"Distributed representations of sentences and documents","author":"le","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam9868"},{"journal-title":"Cayleynets Graph convolutional neural networks with complex rational spectral filters","year":"2017","author":"levie","key":"ref48"},{"key":"ref47","first-page":"1188","article-title":"Spectral networks and locally connected networks on graphs","author":"bruna","year":"2014","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref42","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc Int Conf Very Large Data Bases (VLDB)"},{"key":"ref41","first-page":"630","article-title":"Min-wise independent permutations","author":"broder","year":"1998","journal-title":"Proc Symp Theory of Computing (STOC)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398596"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148222"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/6287639\/8600701\/8600327-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08600327.pdf?arnumber=8600327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:49Z","timestamp":1649444029000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8600327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2890826","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}