{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:38:01Z","timestamp":1775799481633,"version":"3.50.1"},"reference-count":86,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong Research Grants Council under the General Research Fund","award":["PolyU 15200021, PolyU 15200023"],"award-info":[{"award-number":["PolyU 15200021, PolyU 15200023"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072257"],"award-info":[{"award-number":["62072257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP220103717, LE220100078"],"award-info":[{"award-number":["DP220103717, LE220100078"]}],"id":[{"id":"10.13039\/501100000923","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":[[2025,1,31]]},"abstract":"<jats:p>\n            Dynamic recommendation systems, where users interact with items continuously over time, have been widely deployed in real-world online streaming applications. The burst of interaction stream causes a rapid evolution of both users and items. To update representations dynamically, existing studies have investigated event-level and history-level dynamics by modeling the newly arrived interactions and aggregating historical interactions, respectively. However, most of them directly learn the representation evolution as new interactions occur, without exploring the collaboration between the newly arrived and historical interactions, thus failing to scrutinize whether those new interactions would benefit the evolution learning process when generating dynamic representations. Moreover, most of them model the two levels of dynamics independently, explicitly ignoring the inherent co-evolving correlation between them. In this work, we propose the\n            <jats:bold>Temporal Collaboration-Aware Graph Co-Evolution Learning (TCGC)<\/jats:bold>\n            for the dynamic recommendation scenario. First, we explore the effectiveness of collaborative information and devise the collaboration-aware indicator to guide the evolution learning process. Second, we design a temporal co-evolving graph network, enabling our framework to capture the correlation between event and history dynamics. Third, we leverage the evolution task and recommendation task together for joint training. Extensive experiments on four public datasets demonstrate the superiority and effectiveness of our proposed TCGC.\n          <\/jats:p>","DOI":"10.1145\/3687470","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:58:15Z","timestamp":1724777895000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["TCGC: Temporal Collaboration-Aware Graph Co-Evolution Learning for Dynamic Recommendation"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0700-8710","authenticated-orcid":false,"given":"Haoran","family":"Tang","sequence":"first","affiliation":[{"name":"The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6785-1203","authenticated-orcid":false,"given":"Shiqing","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2212-9422","authenticated-orcid":false,"given":"Xueyao","family":"Sun","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3129-9052","authenticated-orcid":false,"given":"Jun","family":"Zeng","sequence":"additional","affiliation":[{"name":"Chongqing University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4493-6663","authenticated-orcid":false,"given":"Guandong","family":"Xu","sequence":"additional","affiliation":[{"name":"The Education University of Hong Kong, New Territories, Hong Kong SAR and University of Technology Sydney, Sydney, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3370-471X","authenticated-orcid":false,"given":"Qing","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR"}]}],"member":"320","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583455"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159727"},{"key":"e_1_3_2_4_2","article-title":"How attentive are graph attention networks?","author":"Brody Shaked","year":"2022","unstructured":"Shaked Brody, Uri Alon, and Eran Yahav. 2022. How attentive are graph attention networks? In ICLR\u2019 22.","journal-title":"ICLR\u2019 22"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3560487"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531922"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614917"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3604915.3608806"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462968"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013312"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449921"},{"key":"e_1_3_2_12_2","unstructured":"Hanjun Dai Yichen Wang Rakshit Trivedi and Le Song. 2017. Deep coevolutionary network: Embedding user and item features for recommendation. arXiv:1609.03675."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3225109"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119875"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531985"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482242"},{"issue":"1","key":"e_1_3_2_17_2","first-page":"3","article-title":"A survey of graph neural networks for recommender systems: Challenges, methods, and directions","volume":"1","author":"Gao Chen","year":"2023","unstructured":"Chen Gao, Yu Zheng, Nian Li, Yinfeng Li, Yingrong Qin, Jinghua Piao, Yuhan Quan, Jianxin Chang, Depeng Jin, Xiangnan He, and Yong Li. 2023b. A survey of graph neural networks for recommender systems: Challenges, methods, and directions. ACM Transactions on Information Systems 1, 1, Article 3 (2023), 51 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110528"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401217"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599450"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583237"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614773"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330895"},{"key":"e_1_3_2_25_2","first-page":"1190","article-title":"AutoMLP: Automated MLP for sequential recommendations","author":"Li Muyang","year":"2023","unstructured":"Muyang Li, Zijian Zhang, Xiangyu Zhao, Wanyu Wang, Minghao Zhao, Runze Wu, and Ruocheng Guo. 2023. AutoMLP: Automated MLP for sequential recommendations. In WWW \u201923, 1190\u20131198.","journal-title":"WWW \u201923"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00041"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481962"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583339"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583466"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5931"},{"key":"e_1_3_2_31_2","article-title":"Decoupled weight decay regularization","author":"Loshchilov Ilya","year":"2019","unstructured":"Ilya Loshchilov and Frank Hutter. 2019. Decoupled weight decay regularization. In ICLR \u201919.","journal-title":"ICLR \u201919"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403207"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191526"},{"issue":"1","key":"e_1_3_2_34_2","first-page":"28","article-title":"Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System","volume":"42","author":"Ni Yuxin","year":"2023","unstructured":"Yuxin Ni, Yunwen Xia, Hui Fang, Chong Long, Xinyu Kong, Daqian Li, Dong Yang, and Jie Zhang. 2023. Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System. ACM Transactions on Information Systems 42, 1, Article 28 (2023), 27 pages.","journal-title":"ACM Transactions on Information Systems"},{"issue":"4","key":"e_1_3_2_35_2","first-page":"67","article-title":"Graph Co-Attentive Session-Based Recommendation","volume":"40","author":"Pan Zhiqiang","year":"2021","unstructured":"Zhiqiang Pan, Fei Cai, Wanyu Chen, and Honghui Chen. 2021. Graph Co-Attentive Session-Based Recommendation. ACM Transactions on Information Systems 40, 4, Article 67 (2021), 31 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635773"},{"key":"e_1_3_2_37_2","unstructured":"Emanuele Rossi Ben Chamberlain Fabrizio Frasca Davide Eynard Federico Monti and Michael Bronstein. 2020. Temporal graph networks for deep learning on dynamic graphs. arXiv:2006.10637."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531754"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583476"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591674"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3653015"},{"key":"e_1_3_2_42_2","article-title":"DyRep: Learning representations over dynamic graphs","author":"Trivedi Rakshit","year":"2019","unstructured":"Rakshit Trivedi, Mehrdad Farajtabar, Prasenjeet Biswal, and Hongyuan Zha. 2019. DyRep: Learning representations over dynamic graphs. In ICLR \u201919.","journal-title":"ICLR \u201919"},{"key":"e_1_3_2_43_2","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In ICLR \u201918.","journal-title":"ICLR \u201918"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599463"},{"key":"e_1_3_2_45_2","unstructured":"Guangtao Wang Rex Ying Jing Huang and Jure Leskovec. 2019b. Improving graph attention networks with large margin-based constraints. arXiv:1910.11945."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411963"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539336"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557317"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210016"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_2_51_2","unstructured":"Yichao Wang Huifeng Guo Ruiming Tang Zhirong Liu and Xiuqiang He. 2020a. A practical incremental method to train deep CTR models. arXiv:2009.02147."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640414"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583229"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3474085.3475665"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512164"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301346"},{"key":"e_1_3_2_58_2","first-page":"1421","article-title":"SOAC: Supervised off-policy actor-critic for recommender systems","author":"Wu Shiqing","year":"2023","unstructured":"Shiqing Wu, Guandong Xu, and Xianzhi Wang. 2023. SOAC: Supervised off-policy actor-critic for recommender systems. In ICDM \u201923, 1421\u20131426.","journal-title":"ICDM \u201923"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645622"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512108"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482354"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635837"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16576"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532058"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3593314"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16579"},{"key":"e_1_3_2_67_2","first-page":"1259","article-title":"Contrastive learning for sequential recommendation","author":"Xie Xu","year":"2022","unstructured":"Xu Xie, Fei Sun, Zhaoyang Liu, Shiwen Wu, Jinyang Gao, Jiandong Zhang, Bolin Ding, and Bin Cui. 2022. Contrastive learning for sequential recommendation. In ICDE \u201922, 1259\u20131273.","journal-title":"ICDE \u201922"},{"key":"e_1_3_2_68_2","article-title":"Inductive representation learning on temporal graphs","author":"Xu Da","year":"2020","unstructured":"Da Xu, Chuanwei Ruan, Evren Korpeoglu, Sushant Kumar, and Kannan Achan. 2020. Inductive representation learning on temporal graphs. In ICLR \u201920.","journal-title":"ICLR \u201920"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2327053"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467422"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532009"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512041"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539274"},{"key":"e_1_3_2_74_2","first-page":"3083","article-title":"Causality-guided graph learning for session-based recommendation","author":"Yu Dianer","year":"2023","unstructured":"Dianer Yu, Qian Li, Hongzhi Yin, and Guandong Xu. 2023. Causality-guided graph learning for session-based recommendation. In CIKM \u201923, 3083\u20133093.","journal-title":"CIKM \u201923"},{"key":"e_1_3_2_75_2","doi-asserted-by":"crossref","first-page":"2432","DOI":"10.24963\/ijcai.2023\/270","article-title":"Sequential recommendation with probabilistic logical reasoning","author":"Yuan Huanhuan","year":"2023","unstructured":"Huanhuan Yuan, Pengpeng Zhao, Xuefeng Xian, Guanfeng Liu, Yanchi Liu, Victor S. Sheng, and Lei Zhao. 2023. Sequential recommendation with probabilistic logical reasoning. In IJCAI \u201923, 2432\u20132440.","journal-title":"IJCAI \u201923"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449810"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583396"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3151618"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2022.3211074"},{"issue":"2","key":"e_1_3_2_80_2","first-page":"26","article-title":"Learning from Substitutable and Complementary Relations for Graph-Based Sequential Product Recommendation","volume":"40","author":"Zhang Wei","year":"2021","unstructured":"Wei Zhang, Zeyuan Chen, Hongyuan Zha, and Jianyong Wang. 2021. Learning from Substitutable and Complementary Relations for Graph-Based Sequential Product Recommendation. ACM Transactions on the Web 40, 2, Article 26 (2021), 28 pages.","journal-title":"ACM Transactions on the Web"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401167"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583433"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531902"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2023.3305285"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599551"},{"key":"e_1_3_2_86_2","doi-asserted-by":"crossref","first-page":"3602","DOI":"10.24963\/ijcai.2017\/504","article-title":"What to do next: Modeling user behaviors by time-LSTM","author":"Zhu Yu","year":"2017","unstructured":"Yu Zhu, Hao Li, Yikang Liao, Beidou Wang, Ziyu Guan, Haifeng Liu, and Deng Cai. 2017. What to do next: Modeling user behaviors by time-LSTM. In IJCAI \u201917, 3602\u20133608.","journal-title":"IJCAI \u201917"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371801"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3687470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:59Z","timestamp":1750291559000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":86,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,31]]}},"alternative-id":["10.1145\/3687470"],"URL":"https:\/\/doi.org\/10.1145\/3687470","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"2024-04-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}