{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T04:23:25Z","timestamp":1768796605044,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:00:00Z","timestamp":1707868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:00:00Z","timestamp":1707868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"the Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["(2021JJ30456,} 2021JJ30734),"],"award-info":[{"award-number":["(2021JJ30456,} 2021JJ30734),"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the Open Research Project of the State Key Laboratory of Industrial Control Technology","award":["No. ICT2022B60"],"award-info":[{"award-number":["No. ICT2022B60"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"name":"the National Defense Science and Technology Key Laboratory Fund Project","award":["2021-KJWPDL-17"],"award-info":[{"award-number":["2021-KJWPDL-17"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972055"],"award-info":[{"award-number":["61972055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recommendation systems have been effectively utilized in various fields, but their internal decision-making methods are still largely unknown. This opaque decision-making method can greatly affect users\u2019 trust in the recommendation system. Therefore, finding a way to explain the reasons for model decisions has become an urgent task. Previous studies often used LSTM and other models to generate recommendation explanations and explain the reasons for recommendations in text form. However, traditional methods cannot effectively use the ID information of users and items, and the text generated is highly repetitive. To solve this problem, this paper uses the method of prompt learning combined with a graph encoder to design a recommendation explanation generation model. In order to narrow the semantic gap between the ID information of users and items and natural language and capture high-level interaction information, this paper designs a graph encoder based on user similarity to learn the interactive semantic information of user and item IDs, and to construct a continuous prompt. Then, the discrete prompt composed of discrete features of users and items is combined with the continuous prompt to construct a hybrid prompt to input into the pre-trained model to generate the recommended explanation. This paper experiments on three publicly available datasets and compares them with several state-of-the-art methods to demonstrate the personalization and text quality of the generated explanations.<\/jats:p>","DOI":"10.1007\/s11063-024-11446-x","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:21Z","timestamp":1707933741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Prompt Recommendation Explanation Generation combined with Graph Encoder"],"prefix":"10.1007","volume":"56","author":[{"given":"Tianhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fen","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidan","family":"Kuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,14]]},"reference":[{"key":"11446_CR1","doi-asserted-by":"crossref","unstructured":"Wu L, He X, Wang X, Zhang K, Wang M (2022) A survey on accuracy-oriented neural recommendation: from collaborative filtering to information-rich recommendation. IEEE Trans Knowl Data Eng 35(5):4425\u20134445","DOI":"10.1109\/TKDE.2022.3145690"},{"key":"11446_CR2","doi-asserted-by":"crossref","unstructured":"Wang S, Hu L, Wang Y, He X, Sheng QZ, Orgun MA, Cao L, Ricci F, Philip SY (2021) Graph learning based recommender systems: a review. In: 30th international joint conference on artificial intelligence, IJCAI 2021. International Joint Conferences on Artificial Intelligence, pp 4644\u20134652","DOI":"10.24963\/ijcai.2021\/630"},{"key":"11446_CR3","doi-asserted-by":"crossref","unstructured":"Mao K, Zhu J, Xiao X, Lu B, Wang Z, He X (2021) Ultragcn: ultra simplification of graph convolutional networks for recommendation. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 1253\u20131262","DOI":"10.1145\/3459637.3482291"},{"key":"11446_CR4","doi-asserted-by":"crossref","unstructured":"Li P, Wang Z, Ren Z, Bing L, Lam W (2017) Neural rating regression with abstractive tips generation for recommendation. In: Proceedings of the 40th international ACM SIGIR conference on research and development in information retrieval, pp 345\u2013354","DOI":"10.1145\/3077136.3080822"},{"key":"11446_CR5","doi-asserted-by":"crossref","unstructured":"Kanehira A, Harada T (2019) Learning to explain with complemental examples. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 8603\u20138611","DOI":"10.1109\/CVPR.2019.00880"},{"issue":"4","key":"11446_CR6","first-page":"1","volume":"41","author":"L Li","year":"2023","unstructured":"Li L, Zhang Y, Chen L (2023) Personalized prompt learning for explainable recommendation. ACM Trans Inf Syst 41(4):1\u201326","journal-title":"ACM Trans Inf Syst"},{"key":"11446_CR7","doi-asserted-by":"crossref","unstructured":"Chen Z, Wang X, Xie X, Wu T, Bu G, Wang Y, Chen E (2019) Co-attentive multi-task learning for explainable recommendation. In: IJCAI, pp 2137\u20132143","DOI":"10.24963\/ijcai.2019\/296"},{"key":"11446_CR8","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. In: Proceedings of the 31st international conference on neural information processing systems 2017, pp 6000\u20136010"},{"issue":"10","key":"11446_CR9","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1109\/TNNLS.2016.2582924","volume":"28","author":"K Greff","year":"2016","unstructured":"Greff K, Srivastava RK, Koutn\u00edk J, Steunebrink BR, Schmidhuber J (2016) Lstm: a search space odyssey. IEEE Trans Neural Netw Learn Syst 28(10):2222\u20132232","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"11446_CR10","unstructured":"Chung J, Gulcehre C, Cho K, Bengio Y (2014) Empirical evaluation of gated recurrent neural networks on sequence modeling. In: NIPS 2014 workshop on deep learning"},{"issue":"8","key":"11446_CR11","first-page":"9","volume":"1","author":"A Radford","year":"2019","unstructured":"Radford A, Wu J, Child R, Luan D, Amodei D, Sutskever I (2019) Language models are unsupervised multitask learners. OpenAI Blog 1(8):9","journal-title":"OpenAI Blog"},{"key":"11446_CR12","unstructured":"Devlin J, Chang M-W, Lee K, Toutanova K (2018) Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805"},{"issue":"9","key":"11446_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3560815","volume":"55","author":"P Liu","year":"2023","unstructured":"Liu P, Yuan W, Fu J, Jiang Z, Hayashi H, Neubig G (2023) Pre-train, prompt, and predict: a systematic survey of prompting methods in natural language processing. ACM Comput Surv 55(9):1\u201335","journal-title":"ACM Comput Surv"},{"key":"11446_CR14","doi-asserted-by":"crossref","unstructured":"Li XL, Liang P (2021) Prefix-tuning: optimizing continuous prompts for generation. In: Proceedings of the 59th annual meeting of the association for computational linguistics and the 11th international joint conference on natural language processing (volume 1: long papers), pp 4582\u20134597","DOI":"10.18653\/v1\/2021.acl-long.353"},{"key":"11446_CR15","doi-asserted-by":"crossref","unstructured":"Geng S, Liu S, Fu Z, Ge Y, Zhang Y (2022) Recommendation as language processing (RLP): a unified pretrain, personalized prompt & predict paradigm (p5). In: Proceedings of the 16th ACM conference on recommender systems, pp 299\u2013315","DOI":"10.1145\/3523227.3546767"},{"key":"11446_CR16","doi-asserted-by":"crossref","unstructured":"Beutel A, Chen J, Doshi T, Qian H, Wei L, Wu Y, Heldt L, Zhao Z, Hong L, Chi EH (2019) Fairness in recommendation ranking through pairwise comparisons. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 2212\u20132220","DOI":"10.1145\/3292500.3330745"},{"issue":"1","key":"11446_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158369","volume":"52","author":"S Zhang","year":"2019","unstructured":"Zhang S, Yao L, Sun A, Tay Y (2019) Deep learning based recommender system: a survey and new perspectives. ACM Comput Surv (CSUR) 52(1):1\u201338","journal-title":"ACM Comput Surv (CSUR)"},{"key":"11446_CR18","doi-asserted-by":"crossref","unstructured":"Zhang Y, Lai G, Zhang M, Zhang Y, Liu Y, Ma S (2014) Explicit factor models for explainable recommendation based on phrase-level sentiment analysis. In: Proceedings of the 37th international ACM SIGIR conference on research and development in information retrieval, pp 83\u201392","DOI":"10.1145\/2600428.2609579"},{"key":"11446_CR19","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. arXiv preprint arXiv:1907.11692"},{"key":"11446_CR20","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown T, Mann B, Ryder N, Subbiah M, Kaplan JD, Dhariwal P, Neelakantan A, Shyam P, Sastry G, Askell A (2020) Language models are few-shot learners. Adv Neural Inf Process Syst 33:1877\u20131901","journal-title":"Adv Neural Inf Process Syst"},{"key":"11446_CR21","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"11446_CR22","unstructured":"Song J, Park J, Yang E (2022) Tam: topology-aware margin loss for class-imbalanced node classification. In: International conference on machine learning. PMLR, pp 20369\u201320383"},{"key":"11446_CR23","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete June 3\u20137, 2018, Proceedings 15. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"11446_CR24","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: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"11446_CR25","doi-asserted-by":"crossref","unstructured":"Yan M, Cheng Z, Gao C, Sun J, Liu F, Sun F, Li H (2023) Cascading residual graph convolutional network for multi-behavior recommendation. ACM Transactions on Information Systems","DOI":"10.1145\/3587693"},{"key":"11446_CR26","doi-asserted-by":"crossref","unstructured":"Liu F, Chen H, Cheng Z, Liu A, Nie L, Kankanhalli M (2022) Disentangled multimodal representation learning for recommendation. IEEE Trans Multimedia","DOI":"10.1109\/TMM.2022.3217449"},{"issue":"4","key":"11446_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3490477","volume":"40","author":"Z Cheng","year":"2022","unstructured":"Cheng Z, Liu F, Mei S, Guo Y, Zhu L, Nie L (2022) Feature-level attentive ICF for recommendation. ACM Trans Inf Syst (TOIS) 40(4):1\u201324","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"11446_CR28","unstructured":"Cai X, Huang C, Xia L, Ren X (2023) Lightgcl: simple yet effective graph contrastive learning for recommendation. arXiv preprint arXiv:2302.08191"},{"key":"11446_CR29","doi-asserted-by":"crossref","unstructured":"Zhang Z, Wang B (2023) Prompt learning for news recommendation. arXiv preprint arXiv:2304.05263","DOI":"10.1145\/3539618.3591752"},{"key":"11446_CR30","doi-asserted-by":"crossref","unstructured":"Li L, Zhang Y, Chen L (2021) Personalized transformer for explainable recommendation. In: Joint conference of the 59th annual meeting of the association for computational linguistics and the 11th international joint conference on natural language processing, ACL-IJCNLP 2021. Association for Computational Linguistics (ACL), pp 4947\u20134957","DOI":"10.18653\/v1\/2021.acl-long.383"},{"key":"11446_CR31","doi-asserted-by":"crossref","unstructured":"Zhou K, Yang J, Loy CC, Liu Z (2022) Conditional prompt learning for vision-language models. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 16816\u201316825","DOI":"10.1109\/CVPR52688.2022.01631"},{"key":"11446_CR32","doi-asserted-by":"crossref","unstructured":"Liu F, Cheng Z, Zhu L, Gao Z, Nie L (2021) Interest-aware message-passing GCN for recommendation. In: Proceedings of the web conference 2021, pp 1296\u20131305","DOI":"10.1145\/3442381.3449986"},{"key":"11446_CR33","doi-asserted-by":"crossref","unstructured":"Papineni K, Roukos S, Ward T, Zhu W-J (2002) Bleu: a method for automatic evaluation of machine translation. In: Proceedings of the 40th annual meeting of the association for computational linguistics, pp 311\u2013318","DOI":"10.3115\/1073083.1073135"},{"key":"11446_CR34","unstructured":"Lin C-Y (2004) Rouge: a package for automatic evaluation of summaries. In: Text summarization branches out, pp 74\u201381"},{"key":"11446_CR35","doi-asserted-by":"crossref","unstructured":"Dong L, Huang S, Wei F, Lapata M, Zhou M, Xu K (2017) Learning to generate product reviews from attributes. In: Proceedings of the 15th conference of the european chapter of the association for computational linguistics: volume 1, long papers, pp 623\u2013632","DOI":"10.18653\/v1\/E17-1059"},{"key":"11446_CR36","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11446-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-024-11446-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11446-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T20:15:19Z","timestamp":1709237719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-024-11446-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,14]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["11446"],"URL":"https:\/\/doi.org\/10.1007\/s11063-024-11446-x","relation":{},"ISSN":["1573-773X"],"issn-type":[{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,14]]},"assertion":[{"value":"14 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"32"}}