{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:49:28Z","timestamp":1783738168774,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Leading Expert of ?Ten Thousands Talent Program? of Zhejiang Province","award":["No.2021R52001"],"award-info":[{"award-number":["No.2021R52001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62172362"],"award-info":[{"award-number":["No.62172362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583366","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"383-394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["Joint Internal Multi-Interest Exploration and External Domain Alignment for Cross Domain Sequential Recommendation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4115-7667","authenticated-orcid":false,"given":"Weiming","family":"Liu","sequence":"first","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5483-0366","authenticated-orcid":false,"given":"Xiaolin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1419-964X","authenticated-orcid":false,"given":"Chaochao","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6899-4174","authenticated-orcid":false,"given":"Jiajie","family":"Su","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8257-2381","authenticated-orcid":false,"given":"Xinting","family":"Liao","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6138-9895","authenticated-orcid":false,"given":"Mengling","family":"Hu","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3526-6859","authenticated-orcid":false,"given":"Yanchao","family":"Tan","sequence":"additional","affiliation":[{"name":"Fuzhou Univerisity, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"SIAM journal on mathematical analysis 35, 1","volume-title":"Minimizing flows for the Monge\u2013Kantorovich problem","author":"Angenent Sigurd","year":"2003","unstructured":"Sigurd Angenent, Steven Haker, and Allen Tannenbaum. 2003. Minimizing flows for the Monge\u2013Kantorovich problem. SIAM journal on mathematical analysis 35, 1 (2003), 61\u201397."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Shai Ben-David John Blitzer Koby Crammer and Fernando Pereira. 2007. Analysis of representations for domain adaptation. In NIPS. 137\u2013144.","DOI":"10.7551\/mitpress\/7503.003.0022"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401193"},{"key":"e_1_3_2_1_4_1","volume-title":"Cross-Domain Recommendation to Cold-Start Users via Variational Information Bottleneck. arXiv preprint arXiv:2203.16863","author":"Cao Jiangxia","year":"2022","unstructured":"Jiangxia Cao, Jiawei Sheng, Xin Cong, Tingwen Liu, and Bin Wang. 2022. Cross-Domain Recommendation to Cold-Start Users via Variational Information Bottleneck. arXiv preprint arXiv:2203.16863 (2022)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403344"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462968"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462866"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512192"},{"key":"e_1_3_2_1_9_1","volume-title":"Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendation. arXiv preprint arXiv:2106.04415","author":"Chen Gaode","year":"2021","unstructured":"Gaode Chen, Xinghua Zhang, Yanyan Zhao, Cong Xue, and Ji Xiang. 2021. Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendation. arXiv preprint arXiv:2106.04415 (2021)."},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Machine Learning. PMLR, 1542\u20131553","author":"Chen Liqun","year":"2020","unstructured":"Liqun Chen, Zhe Gan, Yu Cheng, Linjie Li, Lawrence Carin, and Jingjing Liu. 2020. Graph optimal transport for cross-domain alignment. In International Conference on Machine Learning. PMLR, 1542\u20131553."},{"key":"e_1_3_2_1_11_1","volume-title":"Towards Equivalent Transformation of User Preferences in Cross Domain Recommendation. arXiv preprint arXiv:2009.06884","author":"Chen Xu","year":"2020","unstructured":"Xu Chen, Ya Zhang, Ivor Tsang, Yuangang Pan, and Jingchao Su. 2020. Towards Equivalent Transformation of User Preferences in Cross Domain Recommendation. arXiv preprint arXiv:2009.06884 (2020)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401043"},{"key":"e_1_3_2_1_13_1","volume-title":"You are allset: A multiset function framework for hypergraph neural networks. arXiv preprint arXiv:2106.13264","author":"Chien Eli","year":"2021","unstructured":"Eli Chien, Chao Pan, Jianhao Peng, and Olgica Milenkovic. 2021. You are allset: A multiset function framework for hypergraph neural networks. arXiv preprint arXiv:2106.13264 (2021)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3303"},{"key":"e_1_3_2_1_15_1","volume-title":"Exploiting Data Sparsity in Secure Cross-Platform Social Recommendation. Advances in Neural Information Processing Systems","author":"Cui Jamie","year":"2021","unstructured":"Jamie Cui, Chaochao Chen, Lingjuan Lyu, Carl Yang, and Wang Li. 2021. Exploiting Data Sparsity in Secure Cross-Platform Social Recommendation. Advances in Neural Information Processing Systems (2021)."},{"key":"e_1_3_2_1_16_1","volume-title":"Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26 (2013), 2292\u20132300."},{"key":"e_1_3_2_1_17_1","volume-title":"Deepjdot: Deep joint distribution optimal transport for unsupervised domain adaptation. In ECCV. 447\u2013463.","author":"Damodaran Bharath\u00a0Bhushan","year":"2018","unstructured":"Bharath\u00a0Bhushan Damodaran, Benjamin Kellenberger, R\u00e9mi Flamary, Devis Tuia, and Nicolas Courty. 2018. Deepjdot: Deep joint distribution optimal transport for unsupervised domain adaptation. In ECCV. 447\u2013463."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3185101"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3201533"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271761"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271684"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357914"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00035"},{"key":"e_1_3_2_1_25_1","volume-title":"Adam: A Method for Stochastic Optimization. Computer Science","author":"Kingma D.","year":"2014","unstructured":"D. Kingma and J. Ba. 2014. Adam: A Method for Stochastic Optimization. Computer Science (2014)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01954"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357814"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498388"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467140"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371793"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3074395"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-020-0314-8"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of machine learning research 139","author":"Lin Chi-Heng","year":"2021","unstructured":"Chi-Heng Lin, Mehdi Azabou, and Eva\u00a0L Dyer. 2021. Making transport more robust and interpretable by moving data through a small number of anchor points. Proceedings of machine learning research 139 (2021), 6631."},{"key":"e_1_3_2_1_34_1","first-page":"19223","article-title":"Leveraging distribution alignment via stein path for cross-domain cold-start recommendation","volume":"34","author":"Liu Weiming","year":"2021","unstructured":"Weiming Liu, Jiajie Su, Chaochao Chen, and Xiaolin Zheng. 2021. Leveraging distribution alignment via stein path for cross-domain cold-start recommendation. Advances in Neural Information Processing Systems 34 (2021), 19223\u201319234.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512166"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531975"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3233789"},{"key":"e_1_3_2_1_38_1","volume-title":"Deep Unified Representation for Heterogeneous Recommendation. WWW","author":"Lu Chengqiang","year":"2022","unstructured":"Chengqiang Lu, Mingyang Yin, Shuheng Shen, Luo Ji, Qi Liu, and Hongxia Yang. 2022. Deep Unified Representation for Heterogeneous Recommendation. WWW (2022)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331200"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Tong Man Huawei Shen Xiaolong Jin and Xueqi Cheng. 2017. Cross-Domain Recommendation: An Embedding and Mapping Approach.. In IJCAI. 2464\u20132470.","DOI":"10.24963\/ijcai.2017\/343"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340631.3394870"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Jianmo Ni Jiacheng Li and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In EMNLP-IJCNLP. 188\u2013197. https:\/\/doi.org\/10.18653\/v1\/D19-1018","DOI":"10.18653\/v1"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313733"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291007"},{"key":"e_1_3_2_1_47_1","volume-title":"A dirt-t approach to unsupervised domain adaptation. arXiv preprint arXiv:1802.08735","author":"Shu Rui","year":"2018","unstructured":"Rui Shu, Hung\u00a0H Bui, Hirokazu Narui, and Stefano Ermon. 2018. A dirt-t approach to unsupervised domain adaptation. arXiv preprint arXiv:1802.08735 (2018)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125486.3125488"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.310"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00998"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357895"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159656"},{"key":"e_1_3_2_1_53_1","volume-title":"A contribution to optimal transport on incomparable spaces. arXiv preprint arXiv:2011.04447","author":"Vayer Titouan","year":"2020","unstructured":"Titouan Vayer. 2020. A contribution to optimal transport on incomparable spaces. arXiv preprint arXiv:2011.04447 (2020)."},{"key":"e_1_3_2_1_54_1","volume-title":"Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical properties. arXiv preprint arXiv:1811.02834","author":"Vayer Titouan","year":"2018","unstructured":"Titouan Vayer, Laetita Chapel, R\u00e9mi Flamary, Romain Tavenard, and Nicolas Courty. 2018. Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical properties. arXiv preprint arXiv:1811.02834 (2018)."},{"key":"e_1_3_2_1_55_1","volume-title":"Recsys-dan: discriminative adversarial networks for cross-domain recommender systems","author":"Wang Cheng","year":"2019","unstructured":"Cheng Wang, Mathias Niepert, and Hui Li. 2019. Recsys-dan: discriminative adversarial networks for cross-domain recommender systems. IEEE transactions on neural networks and learning systems 31, 8 (2019), 2731\u20132740."},{"key":"e_1_3_2_1_56_1","volume-title":"HCFRec: Hash Collaborative Filtering via Normalized Flow with Structural Consensus for Efficient Recommendation. arXiv preprint arXiv:2205.12042","author":"Wang Fan","year":"2022","unstructured":"Fan Wang, Weiming Liu, Chaochao Chen, Mengying Zhu, and Xiaolin Zheng. 2022. HCFRec: Hash Collaborative Filtering via Normalized Flow with Structural Consensus for Efficient Recommendation. arXiv preprint arXiv:2205.12042 (2022)."},{"key":"e_1_3_2_1_57_1","volume-title":"Bregman alternating direction method of multipliers. Advances in Neural Information Processing Systems 27","author":"Wang Huahua","year":"2014","unstructured":"Huahua Wang and Arindam Banerjee. 2014. Bregman alternating direction method of multipliers. Advances in Neural Information Processing Systems 27 (2014)."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"e_1_3_2_1_59_1","volume-title":"Capsule network performance on complex data. arXiv preprint arXiv:1712.03480","author":"Xi Edgar","year":"2017","unstructured":"Edgar Xi, Selina Bing, and Yang Jin. 2017. Capsule network performance on complex data. arXiv preprint arXiv:1712.03480 (2017)."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449873"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Chengfeng Xu Pengpeng Zhao Yanchi Liu Jiajie Xu Victor S\u00a0Sheng S.\u00a0Sheng Zhiming Cui Xiaofang Zhou and Hui Xiong. 2019. Recurrent convolutional neural network for sequential recommendation. In The world wide web conference. 3398\u20133404.","DOI":"10.1145\/3308558.3313408"},{"key":"e_1_3_2_1_63_1","volume-title":"International Conference on Machine Learning. PMLR, 10576\u201310586","author":"Xu Hongteng","year":"2020","unstructured":"Hongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah, and Lawrence Carin. 2020. Learning autoencoders with relational regularization. In International Conference on Machine Learning. PMLR, 10576\u201310586."},{"key":"e_1_3_2_1_64_1","volume-title":"International conference on machine learning. PMLR, 6932\u20136941","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence\u00a0Carin Duke. 2019. Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning. PMLR, 6932\u20136941."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICISCE48695.2019.00031"},{"key":"e_1_3_2_1_66_1","volume-title":"Hierarchical graph representation learning with differentiable pooling. Advances in neural information processing systems 31","author":"Ying Zhitao","year":"2018","unstructured":"Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, Will Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. Advances in neural information processing systems 31 (2018)."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449844"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Wenhui Yu Xiao Lin Junfeng Ge Wenwu Ou and Zheng Qin. 2020. Semi-supervised collaborative filtering by text-enhanced domain adaptation. In KDD. 2136\u20132144.","DOI":"10.1145\/3394486.3403264"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401156"},{"key":"e_1_3_2_1_70_1","volume-title":"DARec: Deep domain adaptation for cross-domain recommendation via transferring rating patterns. arXiv preprint arXiv:1905.10760","author":"Yuan Feng","year":"2019","unstructured":"Feng Yuan, Lina Yao, and Boualem Benatallah. 2019. DARec: Deep domain adaptation for cross-domain recommendation via transferring rating patterns. arXiv preprint arXiv:1905.10760 (2019)."},{"key":"e_1_3_2_1_71_1","volume-title":"Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 2561\u20132567","author":"Zhang Yinan","year":"2021","unstructured":"Yinan Zhang, Yong Liu, Peng Han, Chunyan Miao, Lizhen Cui, Baoli Li, and Haihong Tang. 2021. Learning personalized itemset mapping for cross-domain recommendation. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence. 2561\u20132567."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401169"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015941"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015941"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498392"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054229"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:23Z","timestamp":1750178243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":77,"alternative-id":["10.1145\/3543507.3583366","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583366","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}