{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T14:56:01Z","timestamp":1781621761719,"version":"3.54.5"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672481"],"award-info":[{"award-number":["61672481"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Prime Ministers Office Singapore","doi-asserted-by":"crossref","award":["AISG-GC-2019-003"],"award-info":[{"award-number":["AISG-GC-2019-003"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Prime Ministers Office Singapore","doi-asserted-by":"crossref","award":["NRF-NRFI05-2019-0002"],"award-info":[{"award-number":["NRF-NRFI05-2019-0002"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association of the Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["2018495"],"award-info":[{"award-number":["2018495"]}],"id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alibaba Innovative Research AIR Program and Alibaba-NTU Singapore Joint Research Institute","award":["Alibaba-NTU-AIR2019B1"],"award-info":[{"award-number":["Alibaba-NTU-AIR2019B1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3075052","type":"journal-article","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T22:02:25Z","timestamp":1619474545000},"page":"1-1","source":"Crossref","is-referenced-by-count":29,"title":["Learning Hierarchical Review Graph Representations for Recommendation"],"prefix":"10.1109","author":[{"given":"Yong","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunyan","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaiqing","family":"Nie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juyong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00097"},{"key":"ref38","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","first-page":"1993","article-title":"Diffusion-convolutional neural networks","author":"atwood","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2010350"},{"key":"ref31","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016"},{"key":"ref30","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","article-title":"How powerful are graph neural networks?","author":"keyulu xu","year":"2019","journal-title":"Proc 7th Int Conf Learn Representations"},{"key":"ref36","first-page":"339","article-title":"GaAN: Gated attention networks for learning on large and spatiotemporal graphs","author":"zhang","year":"2018","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref35","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017"},{"key":"ref34","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"Gated graph sequence neural networks","author":"li","year":"2016","journal-title":"Proc 4th Int Conf Learn Representations"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2010.5596796"},{"key":"ref29","article-title":"Spectral networks and locally connected networks on graphs","author":"bruna","year":"2014","journal-title":"Proc 2nd Int Conf Learn Representations"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3285029"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098170"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3298988"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271810"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1494"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186158"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref50","article-title":"Hierarchical graph pooling with structure learning","author":"zhang","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref59","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref58","first-page":"8024","article-title":"Pytorch: An imperative style, high-performance deep learning library","author":"paszke","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref56","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"mnih","year":"2008","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1041"},{"key":"ref53","first-page":"404","article-title":"TextRank: Bringing order into text","author":"mihalcea","year":"2004","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref52","article-title":"Graph-based text representations: Boosting text mining, NLP and information retrieval with graphs","author":"malliaros","year":"2017","journal-title":"Proc Conf Empirical Methods Natural Lang Process Tut Abstr"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"ref40","article-title":"Mincut pooling in graph neural networks","author":"bianchi","year":"2019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8715"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645728"},{"key":"ref13","first-page":"2640","article-title":"Rating-boosted latent topics: Understanding users and items with ratings and reviews","author":"tan","year":"2016","journal-title":"Proc 25th Int Joint Conf Artif Intell"},{"key":"ref14","first-page":"2986","article-title":"Collaborative multi-level embedding learning from reviews for rating prediction","author":"zhang","year":"2016","journal-title":"Proc 25th Int Joint Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783273"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018665"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186070"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330906"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331371"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505639"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609593"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240361"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/537"},{"key":"ref8","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref49","article-title":"ASAP: Adaptive structure aware pooling for learning hierarchical graph representations","author":"ranjan","year":"2019"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-015-9155-5"},{"key":"ref9","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313395"},{"key":"ref45","article-title":"Graph u-nets","author":"gao","year":"2019"},{"key":"ref48","article-title":"Edge contraction pooling for graph neural networks","author":"diehl","year":"2019"},{"key":"ref47","article-title":"Self-attention graph pooling","author":"lee","year":"2019"},{"key":"ref42","article-title":"Order matters: Sequence to sequence for sets","author":"vinyals","year":"2015"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"ref44","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"ying","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09416173.pdf?arnumber=9416173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T15:19:32Z","timestamp":1670512772000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9416173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3075052","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}