{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:25:51Z","timestamp":1783700751214,"version":"3.55.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2016YFB1000904"],"award-info":[{"award-number":["2016YFB1000904"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U20A20229, 61976198, and 62022077"],"award-info":[{"award-number":["U20A20229, 61976198, and 62022077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["1947135, 2003924, and 1939725"],"award-info":[{"award-number":["1947135, 2003924, and 1939725"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["201906340183"],"award-info":[{"award-number":["201906340183"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2022,4,30]]},"abstract":"<jats:p>Social recommendation has achieved great success in many domains including e-commerce and location-based social networks. Existing methods usually explore the user-item interactions or user-user connections to predict users\u2019 preference behaviors. However, they usually learn both user and item representations in Euclidean space, which has large limitations for exploring the latent hierarchical property in the data. In this article, we study a novel problem of hyperbolic social recommendation, where we aim to learn the compact but strong representations for both users and items. Meanwhile, this work also addresses two critical domain-issues, which are under-explored. First, users often make trade-offs with multiple underlying aspect factors to make decisions during their interactions with items. Second, users generally build connections with others in terms of different aspects, which produces different influences with aspects in social network. To this end, we propose a novel graph neural network (GNN) framework with multiple aspect learning, namely, HyperSoRec. Specifically, we first embed all users, items, and aspects into hyperbolic space with superior representations to ensure their hierarchical properties. Then, we adapt a GNN with novel multi-aspect message-passing-receiving mechanism to capture different influences among users. Next, to characterize the multi-aspect interactions of users on items, we propose an adaptive hyperbolic metric learning method by introducing learnable interactive relations among different aspects. Finally, we utilize the hyperbolic translational distance to measure the plausibility in each user-item pair for recommendation. Experimental results on two public datasets clearly demonstrate that our HyperSoRec not only achieves significant improvement for recommendation performance but also shows better representation ability in hyperbolic space with strong robustness and reliability.<\/jats:p>","DOI":"10.1145\/3463913","type":"journal-article","created":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T04:37:30Z","timestamp":1632803850000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["HyperSoRec: Exploiting Hyperbolic User and Item Representations with Multiple Aspects for Social-aware Recommendation"],"prefix":"10.1145","volume":"40","author":[{"given":"Hao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Defu","family":"Lian","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1661-0420","authenticated-orcid":false,"given":"Zhenya","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Forest Agostinelli Matthew Hoffman Peter Sadowski and Pierre Baldi. 2014. Learning activation functions to improve deep neural networks. Retrieved from https:\/\/arXiv:1412.6830.  Forest Agostinelli Matthew Hoffman Peter Sadowski and Pierre Baldi. 2014. Learning activation functions to improve deep neural networks. Retrieved from https:\/\/arXiv:1412.6830."},{"key":"e_1_2_1_2_1","unstructured":"Gary B\u00e9cigneul and Octavian-Eugen Ganea. 2018. Riemannian adaptive optimization methods. Retrieved from https:\/\/arXiv:1810.00760.  Gary B\u00e9cigneul and Octavian-Eugen Ganea. 2018. Riemannian adaptive optimization methods. Retrieved from https:\/\/arXiv:1810.00760."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"e_1_2_1_4_1","first-page":"59","article-title":"Hyperbolic geometry","volume":"31","author":"Cannon James W.","year":"1997","unstructured":"James W. Cannon , William J. Floyd , Richard Kenyon , Walter R. Parry et \u00a0al . 1997 . Hyperbolic geometry . Flavors Geom. 31 (1997), 59 \u2013 115 . James W. Cannon, William J. Floyd, Richard Kenyon, Walter R. Parry et\u00a0al. 1997. Hyperbolic geometry. Flavors Geom. 31 (1997), 59\u2013115.","journal-title":"Flavors Geom."},{"key":"e_1_2_1_5_1","unstructured":"Benjamin Paul Chamberlain Stephen R. Hardwick David R. Wardrope Fabon Dzogang Fabio Daolio and Sa\u00fal Vargas. 2019. Scalable hyperbolic recommender systems. Retrieved from https:\/\/arXiv:1902.08648.  Benjamin Paul Chamberlain Stephen R. Hardwick David R. Wardrope Fabon Dzogang Fabio Daolio and Sa\u00fal Vargas. 2019. Scalable hyperbolic recommender systems. Retrieved from https:\/\/arXiv:1902.08648."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3454725"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290982"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372338"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3057278"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401049"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327440"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559169"},{"key":"e_1_2_1_15_1","volume-title":"Peter Battaglia, Victor Bapst, David Raposo, Adam Santoro et\u00a0al.","author":"Gulcehre Caglar","year":"2018","unstructured":"Caglar Gulcehre , Misha Denil , Mateusz Malinowski , Ali Razavi , Razvan Pascanu , Karl Moritz Hermann , Peter Battaglia, Victor Bapst, David Raposo, Adam Santoro et\u00a0al. 2018 . Hyperbolic attention networks. Retrieved from https:\/\/arXiv:1805.09786. Caglar Gulcehre, Misha Denil, Mateusz Malinowski, Ali Razavi, Razvan Pascanu, Karl Moritz Hermann, Peter Battaglia, Victor Bapst, David Raposo, Adam Santoro et\u00a0al. 2018. Hyperbolic attention networks. Retrieved from https:\/\/arXiv:1805.09786."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3172077.3172127"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379507"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379507"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401227"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2300487"},{"key":"e_1_2_1_26_1","volume-title":"Sampling-decomposable generative adversarial recommender. Advances in Neural Information Processing Systems","author":"Jin Binbin","unstructured":"Binbin Jin , Defu Lian , Zheng Liu , Qi Liu , Jianhui Ma , Xing Xie , and Enhong Chen . 2020. Sampling-decomposable generative adversarial recommender. Advances in Neural Information Processing Systems , vol. 33 . MIT Press . Binbin Jin, Defu Lian, Zheng Liu, Qi Liu, Jianhui Ma, Xing Xie, and Enhong Chen. 2020. Sampling-decomposable generative adversarial recommender. Advances in Neural Information Processing Systems, vol. 33. MIT Press."},{"key":"e_1_2_1_27_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba . 2014 . Adam : A method for stochastic optimization. Retrieved from https:\/\/arXiv:1412.6980. Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. Retrieved from https:\/\/arXiv:1412.6980."},{"key":"e_1_2_1_28_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2016","unstructured":"Thomas N. Kipf and Max Welling . 2016 . Semi-supervised classification with graph convolutional networks. Retrieved from https:\/\/arXiv:1609.02907. Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. Retrieved from https:\/\/arXiv:1609.02907."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403226"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the International Conference on Machine Learning. 3672\u20133681","author":"Law Marc","year":"2019","unstructured":"Marc Law , Renjie Liao , Jake Snell , and Richard Zemel . 2019 . Lorentzian distance learning for hyperbolic representations . In Proceedings of the International Conference on Machine Learning. 3672\u20133681 . Marc Law, Renjie Liao, Jake Snell, and Richard Zemel. 2019. Lorentzian distance learning for hyperbolic representations. In Proceedings of the International Conference on Machine Learning. 3672\u20133681."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330856"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380187"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380187"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403252"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623638"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182166"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70735"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352592"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.233"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2924374"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455026"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380232"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tree.2006.02.002"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999792.2999959"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412219"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981562.2981720"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295381"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the International Conference on Machine Learning. 3779\u20133788","author":"Nickel Maximillian","year":"2018","unstructured":"Maximillian Nickel and Douwe Kiela . 2018 . Learning continuous hierarchies in the lorentz model of hyperbolic geometry . In Proceedings of the International Conference on Machine Learning. 3779\u20133788 . Maximillian Nickel and Douwe Kiela. 2018. Learning continuous hierarchies in the lorentz model of hyperbolic geometry. In Proceedings of the International Conference on Machine Learning. 3779\u20133788."},{"key":"e_1_2_1_52_1","volume-title":"Advances in Neural Information Processing Systems","author":"Pei Hongbin","year":"2077","unstructured":"Hongbin Pei , Bingzhe Wei , Kevin Chang , Chunxu Zhang , and Bo Yang . 2020. Curvature regularization to prevent distortion in graph embedding . In Advances in Neural Information Processing Systems , Vol. 33 . MIT Press , 2077 9\u201320790. Hongbin Pei, Bingzhe Wei, Kevin Chang, Chunxu Zhang, and Bo Yang. 2020. Curvature regularization to prevent distortion in graph embedding. In Advances in Neural Information Processing Systems, Vol. 33. MIT Press, 20779\u201320790."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3023092"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.118"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018686"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1795114.1795167"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1993.11990430"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347029"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210023"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186154"},{"key":"e_1_2_1_64_1","unstructured":"Tran Dang Quang Vinh Yi Tay Shuai Zhang Gao Cong and Xiao-Li Li. 2018. Hyperbolic recommender systems. Retrieved from https:\/\/arXiv:1809.01703.  Tran Dang Quang Vinh Yi Tay Shuai Zhang Gao Cong and Xiao-Li Li. 2018. Hyperbolic recommender systems. Retrieved from https:\/\/arXiv:1809.01703."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371850"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00071"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330931"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080771"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015337"},{"key":"e_1_2_1_71_1","volume-title":"A neural influence and interest diffusion network for social recommendation","author":"Wu Le","year":"2020","unstructured":"Le Wu , Junwei Li , Peijie Sun , Richang Hong , Yong Ge , and Meng Wang . 2020. DiffNet++ : A neural influence and interest diffusion network for social recommendation . IEEE Trans. Knowl. Data Eng . ( 2020 ). DOI:10.1109\/TKDE.2020.3048414 10.1109\/TKDE.2020.3048414 Le Wu, Junwei Li, Peijie Sun, Richang Hong, Yong Ge, and Meng Wang. 2020. DiffNet++: A neural influence and interest diffusion network for social recommendation. IEEE Trans. Knowl. Data Eng. (2020). DOI:10.1109\/TKDE.2020.3048414"},{"key":"e_1_2_1_72_1","volume-title":"Socialgcn: An efficient graph convolutional network -based model for social recommendation.","author":"Wu Le","year":"2018","unstructured":"Le Wu , Peijie Sun , Richang Hong , Yanjie Fu , Xiting Wang , and Meng Wang . 2018 . Socialgcn: An efficient graph convolutional network -based model for social recommendation. Retrieved from https:\/\/arXiv:1811.02815. Le Wu, Peijie Sun, Richang Hong, Yanjie Fu, Xiting Wang, and Meng Wang. 2018. Socialgcn: An efficient graph convolutional network -based model for social recommendation. Retrieved from https:\/\/arXiv:1811.02815."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214507000000617"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.5555\/3172077.3172324"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357924"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314578"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2605085"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041658"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015458"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_2_1_81_1","unstructured":"Junliang Yu Hongzhi Yin Jundong Li Min Gao Zi Huang and Lizhen Cui. 2020. Enhancing social recommendation with adversarial graph convolutional networks. Retrieved from https:\/\/arxiv.org\/abs\/2004.02340.  Junliang Yu Hongzhi Yin Jundong Li Min Gao Zi Huang and Lizhen Cui. 2020. Enhancing social recommendation with adversarial graph convolutional networks. Retrieved from https:\/\/arxiv.org\/abs\/2004.02340."},{"key":"e_1_2_1_82_1","unstructured":"Yiding Zhang Xiao Wang Xunqiang Jiang Chuan Shi and Yanfang Ye. 2019. Hyperbolic graph attention network. Retrieved from https:\/\/arXiv:1912.03046.  Yiding Zhang Xiao Wang Xunqiang Jiang Chuan Shi and Yanfang Ye. 2019. Hyperbolic graph attention network. Retrieved from https:\/\/arXiv:1912.03046."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661998"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158670"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3425637"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3463913","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3463913","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3463913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:15Z","timestamp":1750191135000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3463913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":85,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4,30]]}},"alternative-id":["10.1145\/3463913"],"URL":"https:\/\/doi.org\/10.1145\/3463913","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"2020-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}