{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:23:21Z","timestamp":1760833401141,"version":"build-2065373602"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"9","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62176011 and 62301443"],"award-info":[{"award-number":["62176011 and 62301443"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Beijing Natural Science Foundation","award":["L241053 and L233008"],"award-info":[{"award-number":["L241053 and L233008"]}]},{"name":"Open Project of Tianjin Key Laboratory of Optoelectronic Detection Technology and System","award":["2024LODTS115"],"award-info":[{"award-number":["2024LODTS115"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,11,30]]},"abstract":"<jats:p>In the domain of recommendations, previous works often retrieve items through sampling strategies from the database to gather negative signals for exploring implicit feedback. However, because of extremely sparse records, the existing items used as negative samples may not sufficiently support the interacted items in depicting the diverse interests of users. Consequently, the generation of negative samples needs to be explored in recommendation systems. In this study, we propose an interest-disentangled contrastive sample generation (IDCG) model to enhance interest modeling by contrasting interacted items with the generated samples for recommendation. Specifically, we decouple the interacted items of users into positively relevant and irrelevant factors of interest, providing a valuable clue to learn negatively relevant factors in personalized interests. Then, negative samples are generated by merging the learned negatively relevant factors and irrelevant factors. At this point, a two-level contrast is constructed between positive and negative samples and between the relevant factors of positives and negatives, providing auxiliary collaborative signals to debias and alleviate the interaction sparsity issue. Extensive experiments on three real datasets demonstrate the effectiveness of IDCG in generating targeted and meaningful negative samples from the perspective of disentangling relevant factors to promote interest modeling for recommendation.<\/jats:p>","DOI":"10.1145\/3768160","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:17:58Z","timestamp":1758028678000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Interest-Disentangled Contrastive Sample Generation for Recommendation"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5659-5128","authenticated-orcid":false,"given":"Meng","family":"Jian","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9180-4175","authenticated-orcid":false,"given":"Ruoxi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8094-8920","authenticated-orcid":false,"given":"Meishan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9277-7751","authenticated-orcid":false,"given":"Meijuan","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi\u2019an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1677-1048","authenticated-orcid":false,"given":"Shaona","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronic Engineering, Tiangong University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7209-0215","authenticated-orcid":false,"given":"Lifang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Beijing University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,18]]},"reference":[{"key":"e_1_3_1_2_2","article-title":"A graph neural approach for group recommendation system based on pairwise preferences","volume":"107","author":"Abolghasemi Roza","year":"2024","unstructured":"Roza Abolghasemi, Enrique Herrera Viedma, Paal Engelstad, Youcef Djenouri, and Anis Yazidi. 2024. A graph neural approach for group recommendation system based on pairwise preferences. Information Fusion 107, C (July 2024), 16 pages.","journal-title":"Information Fusion"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2022.11.021"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645517"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671800"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467408"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108100"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.08.062"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570419"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData62323.2024.10825433"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512104"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2024.3356071"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData59044.2023.10386885"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532031"},{"key":"e_1_3_1_21_2","unstructured":"Aaron van den Oord Yazhe Li and Oriol Vinyals. 2018. Representation learning with contrastive predictive coding. arXiv:1807.03748. Retrieved from https:\/\/arxiv.org\/abs\/1807.03748"},{"key":"e_1_3_1_22_2","first-page":"452","volume-title":"Proceedings of the Uncertainty in Artificial Intelligence","author":"Rendle Steffen","year":"2014","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars BPR Schmidt-Thieme. 2014. Bayesian personalized ranking from implicit feedback. In Proceedings of the Uncertainty in Artificial Intelligence, 452\u2013461."},{"key":"e_1_3_1_23_2","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"van den Berg Rianne","year":"2018","unstructured":"Rianne van den Berg, N. Kipf Thomas, and Max Welling. 2018. Graph convolutional matrix completion. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201918)."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380098"},{"key":"e_1_3_1_26_2","article-title":"Cross-modal contrastive learning for aspect-based recommendation","volume":"99","author":"Won Heesoo","year":"2023","unstructured":"Heesoo Won, Byungkook Oh, Hyeongjun Yang, and Kyong-Ho Lee. 2023. Cross-modal contrastive learning for aspect-based recommendation. Information Fusion 99, C (Nov. 2023), 11 pages.","journal-title":"Information Fusion"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Hanrui Wu Jinyi Long Nuosi Li Dahai Yu and Michael K. Ng. 2022. Adversarial auto-encoder domain adaptation for cold-start recommendation with positive and negative hypergraphs. ACM Transactions on Information Systems 41 2 Article 33 (Dec. 2022) 25 pages.","DOI":"10.1145\/3544105"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Jiancan Wu Xiang Wang Xingyu Gao Jiawei Chen Hongcheng Fu and Tianyu Qiu. 2024. On the effectiveness of sampled softmax loss for item recommendation. ACM Transactions on Information Systems 42 4 Article 98 (Mar. 2024) 26 pages.","DOI":"10.1145\/3637061"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403218"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_1_32_2","unstructured":"Junliang Yu Xin Xia Tong Chen Lizhen Cui Nguyen Quoc Viet Hung and Hongzhi Yin. 2023. XSimGCL: Towards extremely simple graph contrastive learning for recommendation. IEEE Transactions on Knowledge and Data Engineering 36 2 (2023) 913\u2013926."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449844"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531937"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484126"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657738"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3768160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T09:09:28Z","timestamp":1760778568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3768160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,18]]},"references-count":36,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,11,30]]}},"alternative-id":["10.1145\/3768160"],"URL":"https:\/\/doi.org\/10.1145\/3768160","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2025,10,18]]},"assertion":[{"value":"2025-01-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}