{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:46:02Z","timestamp":1765529162415,"version":"3.48.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276277"],"award-info":[{"award-number":["62276277"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Recommendation system technologies predominantly focus on user-item interaction data, which are mapped into shared vector spaces for digital representation. These representations are then analyzed to uncover the relationships between users and items. As recommendation technologies have seen widespread adoption, a novel challenge has emerged in supply-demand matching contexts: the dual-triangular recommendation problem, involving four key entities, i.e., users with their demands, and suppliers with their offered items, forming a heterogeneous information network. In this work, we introduce the concept of dual-triangular recommendation and formally define this scientific problem. We propose a dual-triangular recommendation algorithm, enhanced by large language models, which utilizes knowledge graph encoder and LLM-augmented encoder to generate embedding representations for the four entities. A multi-task framework is employed to enable the sharing of underlying parameters across multiple recommendation tasks within the dual-triangular context. Through extensive experiments conducted on a real-world technology commercialization platform dataset, patent transfer dataset, and talent recruitment dataset, we demonstrate the effectiveness of our approach, offering a feasible and scalable solution to the dual-triangular recommendation problem.<\/jats:p>","DOI":"10.1007\/s41019-025-00310-0","type":"journal-article","created":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T03:19:46Z","timestamp":1763003986000},"page":"800-818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual-triangular Recommender System"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-6847","authenticated-orcid":false,"given":"Pei-Yuan","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7561-3704","authenticated-orcid":false,"given":"Qing-Yun","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5972-559X","authenticated-orcid":false,"given":"Chang-Dong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,13]]},"reference":[{"issue":"3","key":"310_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TBDATA.2016.2602849","volume":"4","author":"L Qi","year":"2018","unstructured":"Qi L, Xu X, Zhang X, Dou W, Hu C, Zhou Y, Yu J (2018) Structural balance theory-based e-commerce recommendation over big rating data. IEEE Trans Big Data 4(3):301\u2013312","journal-title":"IEEE Trans Big Data"},{"issue":"11","key":"310_CR2","doi-asserted-by":"publisher","first-page":"4680","DOI":"10.1109\/TCYB.2019.2896766","volume":"50","author":"W Zhao","year":"2020","unstructured":"Zhao W, Wang B, Yang M, Ye J, Zhao Z, Chen X, Shen Y (2020) Leveraging long and short-term information in content-aware movie recommendation via adversarial training. IEEE Trans Cybern 50(11):4680\u20134693","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"310_CR3","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1109\/TNNLS.2020.2984665","volume":"32","author":"D Wang","year":"2021","unstructured":"Wang D, Zhang X, Yu D, Xu G, Deng S (2021) Came: content- and context-aware music embedding for recommendation. IEEE Trans Neural Netw Learn Syst 32(3):1375\u20131388","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"310_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s41019-023-00204-z","volume":"8","author":"C Li","year":"2023","unstructured":"Li C, Zhou B, Lin W, Tang Z, Tang Y, Zhang Y, Cao J (2023) A personalized explainable learner implicit friend recommendation method. Data Sci Eng 8(1):23\u201335","journal-title":"Data Sci Eng"},{"issue":"3","key":"310_CR5","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1007\/s10115-023-01997-1","volume":"66","author":"P Lai","year":"2024","unstructured":"Lai P, Yang Z, Dai Q, Liao D, Wang C (2024) BiMuF: a bi-directional recommender system with multi-semantic filter for online recruitment. Knowl Inf Syst 66(3):1751\u20131776","journal-title":"Knowl Inf Syst"},{"issue":"9","key":"310_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/JOEUC.303677","volume":"34","author":"L Cai","year":"2022","unstructured":"Cai L, Lu S, Chen B (2022) Constructing technology commercialization capability: the critical role of user engagement and big data analytics capability. J Organ End User Comput 34(9):1\u201321","journal-title":"J Organ End User Comput"},{"key":"310_CR7","doi-asserted-by":"crossref","unstructured":"Wang X, Chen Z, Wang H, U LH, Li Z, Guo W (2025) Large language model enhanced knowledge representation learning: A survey. Data Sci. Eng.","DOI":"10.1007\/s41019-025-00285-y"},{"issue":"3","key":"310_CR8","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1038\/s42256-022-00458-8","volume":"4","author":"P Schramowski","year":"2022","unstructured":"Schramowski P, Turan C, Andersen N, Rothkopf CA, Kersting K (2022) Large pre-trained language models contain human-like biases of what is right and wrong to do. Nat Mach Intell 4(3):258\u2013268","journal-title":"Nat Mach Intell"},{"key":"310_CR9","unstructured":"DeepSeek-AI Guo D, Yang D, Zhang H, Song J, Zhang R, Xu R, Zhu Q, Ma S, Wang P, Bi X, Zhang X, Yu X, Wu Y, Wu ZF, Gou Z, Shao Z, Li Z, Gao Z, Liu A, Xue B, Wang B, Wu B, Feng B, Lu C, Zhao C, Deng C, Zhang C, Ruan C, Dai D, Chen D, Ji D, Li E, Lin F, Dai F, Luo F, Hao G, Chen G, Li G, Zhang, H, Bao H, Xu H, Wang H, Ding H, Xin H, Gao H, Qu H, Li H, Guo J, Li J, Wang J, Chen J, Yuan J, Qiu J, Li J, Cai JL. Ni J, Liang J, Chen J, Dong K, Hu K, Gao K, Guan K, Huang K, Yu K, Wang L, Zhang L, Zhao L, Wang L, Zhang L, Xu L, Xia L, Zhang M, Zhang M, Tang M, Li M, Wang M, Li M, Tian N, Huang P, Zhang P, Wang Q, Chen Q, Du Q, Ge R, Zhang R, Pan R, Wang R, Chen RJ, Jin RL, Chen R, Lu S, Zhou S, Chen S, Ye S, Wang S, Yu S, Zhou S, Pan S, Li SS (2025) Deepseek-r1: Incentivizing reasoning capability in LLMs via reinforcement learning. CoRR abs\/2501.12948"},{"issue":"11","key":"310_CR10","doi-asserted-by":"publisher","first-page":"6889","DOI":"10.1109\/TKDE.2024.3392335","volume":"36","author":"Z Zhao","year":"2024","unstructured":"Zhao Z, Fan W, Li J, Liu Y, Mei X, Wang Y, Wen Z, Wang F, Zhao X, Tang J, Li Q (2024) Recommender systems in the era of large language models (LLMs). IEEE Trans Knowl Data Eng 36(11):6889\u20136907","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"310_CR11","doi-asserted-by":"crossref","unstructured":"Kim S, Kang H, Choi S, Kim D, Yang M, Park C (2024) Large language models meet collaborative filtering: An efficient all-round llm-based recommender system. In: ACM SIGKDD, pp. 1395\u20131406","DOI":"10.1145\/3637528.3671931"},{"key":"310_CR12","doi-asserted-by":"crossref","unstructured":"Wang J, Karatzoglou A, Arapakis I, Jose JM (2024) Reinforcement learning-based recommender systems with large language models for state reward and action modeling. In: ACM SIGIR, pp. 375\u2013385","DOI":"10.1145\/3626772.3657767"},{"key":"310_CR13","doi-asserted-by":"crossref","unstructured":"Liao J, Li S, Yang Z, Wu J, Yuan Y, Wang X, He X (2024) Llara: Large language-recommendation assistant. In: ACM SIGIR, pp. 1785\u20131795","DOI":"10.1145\/3626772.3657690"},{"issue":"2","key":"310_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s41019-024-00245-y","volume":"9","author":"Y Liu","year":"2024","unstructured":"Liu Y, Wang S, Li X, Sun F (2024) A meta-adversarial framework for cross-domain cold-start recommendation. Data Sci Eng 9(2):238\u2013249","journal-title":"Data Sci Eng"},{"key":"310_CR15","unstructured":"Zhang W, Bei Y, Yang L, Zou HP, Zhou P, Liu A, Li Y, Chen H, Wang J, Wang Y, Huang F, Zhou S, Bu J, Lin A, Caverlee J, Karray F, King I, Yu PS (2025) Cold-start recommendation towards the era of large language models (LLMs): A comprehensive survey and roadmap. CoRR abs\/2501.01945"},{"key":"310_CR16","volume-title":"Recommendation as instruction following: A large language model empowered recommendation approach","author":"J Zhang","year":"2024","unstructured":"Zhang J, Xie R, Hou Y, Zhao WX, Lin L, Wen J (2024) Recommendation as instruction following: A large language model empowered recommendation approach. ACM Trans. Inf, Syst"},{"key":"310_CR17","doi-asserted-by":"crossref","unstructured":"Tan J, Xu S, Hua W, Ge Y, Li Z, Zhang Y (2024) Idgenrec: Llm-recsys alignment with textual ID learning. In: ACM SIGIR, pp. 355\u2013364","DOI":"10.1145\/3626772.3657821"},{"key":"310_CR18","unstructured":"Lin J, Dai X, Xi Y, Liu W, Chen B, Li X, Zhu C, Guo H, Yu Y, Tang R, Zhang W (2023) How can recommender systems benefit from large language models: A survey. CoRR abs\/2306.05817"},{"key":"310_CR19","doi-asserted-by":"crossref","unstructured":"Wang J, Lu H, Caverlee J, Chi EH, Chen M (2024) Large language models as data augmenters for cold-start item recommendation. In: ACM WWW, pp. 726\u2013729","DOI":"10.1145\/3589335.3651532"},{"key":"310_CR20","unstructured":"Zhang Y, Feng F, Zhang J, Bao K, Wang Q, He X (2023) CoLLM: Integrating collaborative embeddings into large language models for recommendation. CoRR abs\/2310.19488"},{"key":"310_CR21","unstructured":"Chen J, Chi L, Peng B, Yuan Z (2024) HLLM: enhancing sequential recommendations via hierarchical large language models for item and user modeling. CoRR abs\/2409.12740"},{"key":"310_CR22","doi-asserted-by":"crossref","unstructured":"Lai K, Xi W, Xing X, Wan W, Wang C, Chen M, Guizani M (2024) Reccoder: Reformulating sequential recommendation as large language model-based code completion. In: ICDM, pp. 191\u2013200","DOI":"10.1109\/ICDM59182.2024.00026"},{"key":"310_CR23","unstructured":"Christakopoulou K, Lalama A, Adams C, Qu I, Amir Y, Chucri S, Vollucci P, Soldo F, Bseiso D, Scodel S, Dixon L, Chi EH, Chen M (2023) Large language models for user interest journeys. CoRR abs\/2305.15498"},{"issue":"3","key":"310_CR24","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s41019-020-00118-0","volume":"5","author":"LF Sikos","year":"2020","unstructured":"Sikos LF, Philp D (2020) Provenance-aware knowledge representation: a survey of data models and contextualized knowledge graphs. Data Sci Eng 5(3):293\u2013316","journal-title":"Data Sci Eng"},{"issue":"2","key":"310_CR25","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s41019-023-00237-4","volume":"9","author":"B Wei","year":"2024","unstructured":"Wei B, Guo X, Li X, Wu Z, Zhao J, Zou Q (2024) Construct and query A fine-grained geospatial knowledge graph. Data Sci Eng 9(2):152\u2013176","journal-title":"Data Sci Eng"},{"key":"310_CR26","doi-asserted-by":"crossref","unstructured":"Wang X, Huang T, Wang D, Yuan Y, Liu Z, He X, Chua T (2021) Learning intents behind interactions with knowledge graph for recommendation. In: WWW, pp. 878\u2013887","DOI":"10.1145\/3442381.3450133"},{"key":"310_CR27","unstructured":"Bordes A, Usunier N, Garc\u00eda-Dur\u00e1n A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: NeurIPS, pp. 2787\u20132795"},{"key":"310_CR28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870","author":"Z Wang","year":"2014","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. AAAI. https:\/\/doi.org\/10.1609\/aaai.v28i1.8870","journal-title":"AAAI"},{"key":"310_CR29","doi-asserted-by":"crossref","unstructured":"Yang H, Liu J (2021) Knowledge graph representation learning as groupoid: Unifying transe, rotate, quate, complex. In: CIKM, pp. 2311\u20132320","DOI":"10.1145\/3459637.3482442"},{"key":"310_CR30","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Cao Y, Liu M, Chua T (2019) KGAT: knowledge graph attention network for recommendation. In: ACM SIGKDD, pp. 950\u2013958","DOI":"10.1145\/3292500.3330989"},{"key":"310_CR31","doi-asserted-by":"crossref","unstructured":"Zhang P, Yan Y, Zhang X, Li C, Wang S, Huang F, Kim S (2024) Transgnn: Harnessing the collaborative power of transformers and graph neural networks for recommender systems. In: ACM SIGIR, pp. 1285\u20131295","DOI":"10.1145\/3626772.3657721"},{"key":"310_CR32","doi-asserted-by":"crossref","unstructured":"Huang C (2021) Recent advances in heterogeneous relation learning for recommendation. In: IJCAI, pp. 4442\u20134449","DOI":"10.24963\/ijcai.2021\/606"},{"key":"310_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123403","volume":"248","author":"Y Cui","year":"2024","unstructured":"Cui Y, Yu H, Guo X, Cao H, Wang L (2024) RAKCR: reviews sentiment-aware based knowledge graph convolutional networks for personalized recommendation. Expert Syst Appl 248:123403","journal-title":"Expert Syst Appl"},{"key":"310_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110078","volume":"259","author":"N Zhao","year":"2023","unstructured":"Zhao N, Long Z, Wang J, Zhao Z (2023) Agre: a knowledge graph recommendation algorithm based on multiple paths embeddings RNN encoder. Knowl-Based Syst 259:110078","journal-title":"Knowl-Based Syst"},{"key":"310_CR35","doi-asserted-by":"crossref","unstructured":"Sun R, Cao X, Zhao Y, Wan J, Zhou K, Zhang F, Wang Z, Zheng K (2020) Multi-modal knowledge graphs for recommender systems. In: CIKM, pp. 1405\u20131414","DOI":"10.1145\/3340531.3411947"},{"key":"310_CR36","unstructured":"Wang Y, Lam HT, Wong Y, Liu Z, Zhao X, Wang Y, Chen B, Guo H, Tang R (2023) Multi-task deep recommender systems: A survey. CoRR abs\/2302.03525"},{"issue":"1","key":"310_CR37","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s41019-019-0087-7","volume":"4","author":"Y Chen","year":"2019","unstructured":"Chen Y, Ma Y, Mao X, Li Q (2019) Multi-task learning for abstractive and extractive summarization. Data Sci Eng 4(1):14\u201323","journal-title":"Data Sci Eng"},{"key":"310_CR38","doi-asserted-by":"crossref","unstructured":"Bai T, Xiao Y, Wu B, Yang G, Yu H, Nie J (2022) A contrastive sharing model for multi-task recommendation. In: WWW, pp. 3239\u20133247","DOI":"10.1145\/3485447.3512043"},{"key":"310_CR39","doi-asserted-by":"crossref","unstructured":"He Y, Feng X, Cheng C, Ji G, Guo Y, Caverlee J (2022) Metabalance: Improving multi-task recommendations via adapting gradient magnitudes of auxiliary tasks. In: WWW, pp. 2205\u20132215","DOI":"10.1145\/3485447.3512093"},{"key":"310_CR40","doi-asserted-by":"crossref","unstructured":"Bi Q, Li J, Shang L, Jiang X, Liu Q, Yang H (2022) Mtrec: Multi-task learning over BERT for news recommendation. In: ACL, pp. 2663\u20132669","DOI":"10.18653\/v1\/2022.findings-acl.209"},{"key":"310_CR41","doi-asserted-by":"crossref","unstructured":"Lim N, Hooi B, Ng S, Goh YL, Weng R, Tan R (2022) Hierarchical multi-task graph recurrent network for next POI recommendation. In: ACM SIGIR, pp. 1133\u20131143","DOI":"10.1145\/3477495.3531989"},{"key":"310_CR42","doi-asserted-by":"crossref","unstructured":"Zhu F, Chen C, Wang Y, Liu G, Zheng X (2019) DTCDR: A framework for dual-target cross-domain recommendation. In: CIKM, pp. 1533\u20131542","DOI":"10.1145\/3357384.3357992"},{"key":"310_CR43","doi-asserted-by":"crossref","unstructured":"Zhang Q, Liu J, Dai Y, Qi Y, Yuan Y, Zheng K, Huang F, Tan X. (2022) Multi-task fusion via reinforcement learning for long-term user satisfaction in recommender systems. In: KDD, pp. 4510\u20134520","DOI":"10.1145\/3534678.3539040"},{"key":"310_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117755","volume":"206","author":"X Feng","year":"2022","unstructured":"Feng X, Liu Z, Wu W, Zuo W (2022) Social recommendation via deep neural network-based multi-task learning. Expert Syst Appl 206:117755","journal-title":"Expert Syst Appl"},{"key":"310_CR45","unstructured":"Li H, Wu K, Zheng C, Xiao Y, Wang H, Geng Z, Feng F, He X, Wu P (2023) Removing hidden confounding in recommendation: A unified multi-task learning approach. In: NeurIPS"},{"key":"310_CR46","doi-asserted-by":"crossref","unstructured":"Wang M, Lin Y, Lin G, Yang K, Wu X (2020) M2GRL: A multi-task multi-view graph representation learning framework for web-scale recommender systems. In: KDD, pp. 2349\u20132358","DOI":"10.1145\/3394486.3403284"},{"key":"310_CR47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060","author":"C Shang","year":"2019","unstructured":"Shang C, Tang Y, Huang J, Bi J, He X, Zhou B, AAAI (2019) End-to-end structure-aware convolutional networks for knowledge base completion. Proceedings of the AAAI Conference on Artificial Intelligence. https:\/\/doi.org\/10.1609\/aaai.v33i01.33013060","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"310_CR48","doi-asserted-by":"crossref","unstructured":"Qian T, Liang Y, Li Q, Xiong H (2023) Attribute graph neural networks for strict cold start recommendation : Extended abstract. In: ICDE, pp. 3783\u20133784","DOI":"10.1109\/ICDE55515.2023.00318"},{"key":"310_CR49","doi-asserted-by":"crossref","unstructured":"Zhai J, Zheng X, Wang C, Li H, Tian Y (2023) Knowledge prompt-tuning for sequential recommendation. In: ACM MM, pp. 6451\u20136461","DOI":"10.1145\/3581783.3612252"},{"key":"310_CR50","unstructured":"Liu Y, Ott M, Goyal N, Du J, Joshi M, Chen D, Levy O, Lewis M, Zettlemoyer L, Stoyanov V (2019) RoBERTa: A robustly optimized BERT pretraining approach. CoRR abs\/1907.11692"},{"issue":"2","key":"310_CR51","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TETCI.2024.3442872","volume":"9","author":"P Lai","year":"2025","unstructured":"Lai P, Dai Q, Liao D, Yang Z, Liao X, Wang C, Chen M (2025) MASER: multi-order attention and semantic-enhanced representation model for complex text recommendation. IEEE Trans Emerg Top Comput Intell 9(2):1743\u20131755","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"310_CR52","unstructured":"Carrington AM, Manuel DG, Fieguth PW, Ramsay T, Osmani V, Wernly B, Bennett C, Hawken S, McInnes M, Magwood O, Sheikh Y, Holzinger A (2021) Deep ROC analysis and AUC as balanced average accuracy to improve model selection, understanding and interpretation. CoRR abs\/2103.11357"},{"issue":"4","key":"310_CR53","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10462-015-9433-y","volume":"44","author":"G Santaf\u00e9","year":"2015","unstructured":"Santaf\u00e9 G, Inza I, Lozano JA (2015) Dealing with the evaluation of supervised classification algorithms. Artif Intell Rev 44(4):467\u2013508","journal-title":"Artif Intell Rev"},{"key":"310_CR54","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) LightGCN: Simplifying and powering graph convolution network for recommendation. In: Huang, J.X., Chang, Y., Cheng, X., Kamps, J., Murdock, V., Wen, J., Liu, Y. (eds.) ACM SIGIR, pp. 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"310_CR55","unstructured":"Cai X, Huang C, Xia L, Ren X (2023) Lightgcl: Simple yet effective graph contrastive learning for recommendation. In: ICLR"},{"key":"310_CR56","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T (2017) Neural collaborative filtering. In: WWW, pp. 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"310_CR57","doi-asserted-by":"crossref","unstructured":"Wu J, Wang X, Feng F, He X, Chen L, Lian J, Xie X (2021) Self-supervised graph learning for recommendation. In: ACM SIGIR, pp. 726\u2013735","DOI":"10.1145\/3404835.3462862"},{"key":"310_CR58","unstructured":"Li H, Zheng C, Xiao Y, Wu P, Geng Z, Chen X, Cui P (2024) Debiased collaborative filtering with kernel-based causal balancing. In: ICLR"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00310-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00310-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00310-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:42:12Z","timestamp":1765528932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00310-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,13]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["310"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00310-0","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2025,11,13]]},"assertion":[{"value":"20 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"The source code will be made publicly available after acceptance.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}