{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:15:11Z","timestamp":1767183311750},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T00:00:00Z","timestamp":1719532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T00:00:00Z","timestamp":1719532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Key Research and Development Program of Linyi City","award":["2022028"],"award-info":[{"award-number":["2022028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Sequential recommendation is the mainstream approach in the field of click-through-rate (CTR) prediction for modeling users\u2019 behavior. This behavior implies the change of the user\u2019s interest, and the goal of sequential recommendation is to capture this dynamic change. However, existing studies have focused on designing complex dedicated networks to capture user interests from user behavior sequences, while neglecting the use of auxiliary information. Recently, knowledge graph (KG) has gradually attracted the attention of researchers as a structured auxiliary information. Items and their attributes in the recommendation, can be mapped to knowledge triples in the KG. Therefore, the introduction of KG to recommendation can help us obtain more expressive item representations. Since KG can be considered a special type of graph, it is possible to use the graph neural network (GNN) to propagate the rich information contained in the KG into the item representation. Based on this idea, this paper proposes a recommendation method that uses KG as auxiliary information. The method first propagates the knowledge information in the KG using GNN to obtain a knowledge-rich item representation. Then the temporal features in the item sequence are extracted using a transformer for CTR prediction, namely the <jats:bold>K<\/jats:bold>nowledge <jats:bold>G<\/jats:bold>raph-Aware <jats:bold>D<\/jats:bold>eep <jats:bold>I<\/jats:bold>nterest <jats:bold>E<\/jats:bold>xtraction network (KGDIE). To evaluate the performance of this model, we conducted extensive experiments on two real datasets with different scenarios. The results showed that the KGDIE method could outperform several state-of-the-art baselines. The source code of our model is available at <jats:ext-link xmlns:xlink=\"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/github.com\/gylgyl123\/kgdie\">https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/github.com\/gylgyl123\/kgdie<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s11063-024-11665-2","type":"journal-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T04:03:28Z","timestamp":1719547408000},"update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Knowledge Graph-Aware Deep Interest Extraction Network on Sequential Recommendation"],"prefix":"10.1007","volume":"56","author":[{"given":"Zhenhai","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yuhao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhiru","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Yunlong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Weimin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,28]]},"reference":[{"key":"11665_CR1","first-page":"150","volume":"15","author":"YM Huang","year":"2012","unstructured":"Huang YM, Liu CH, Lee CY, Huang YM (2012) Designing a personalized guide recommendation system to mitigate information overload in museum learning. J Educ Technol Soc 15:150\u2013166","journal-title":"J Educ Technol Soc"},{"key":"11665_CR2","first-page":"7157075","volume":"2022","author":"J Sun","year":"2022","unstructured":"Sun J (2022) Personalized music recommendation algorithm based on spark platform. Comput intell neurosci 2022:7157075","journal-title":"Comput intell neurosci"},{"key":"11665_CR3","first-page":"6602471","volume":"2022","author":"L Li","year":"2022","unstructured":"Li L (2022) Cross-Border E-Commerce intelligent information recommendation system based on deep learning. Comput Intell Neurosci 2022:6602471","journal-title":"Comput Intell Neurosci"},{"doi-asserted-by":"crossref","unstructured":"W Zhang, J Qin, W Guo, R Tang, X He (2021) Deep Learning for Click-Through Rate Estimation. arXiv, vol. abs\/2104.10584","key":"11665_CR4","DOI":"10.24963\/ijcai.2021\/636"},{"doi-asserted-by":"crossref","unstructured":"J. Tang and K. Wang, (2018) Personalized top-n sequential recommendation via convolutional sequence embedding. In: Proceedings of the eleventh ACM international conference on web search and data mining. 565\u2013573","key":"11665_CR5","DOI":"10.1145\/3159652.3159656"},{"doi-asserted-by":"crossref","unstructured":"G Zhou et al., (2019) Deep interest evolution network for click-through rate prediction. In: AAAI Conference on Artificial Intelligence. 33: (01)5941-5948","key":"11665_CR6","DOI":"10.1609\/aaai.v33i01.33015941"},{"unstructured":"B Hidasi, A Karatzoglou, L Baltrunas, D Tikk (2015) Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939","key":"11665_CR7"},{"doi-asserted-by":"crossref","unstructured":"X Chen et al., (2018) Sequential recommendation with user memory networks. In: Proceedings of the eleventh ACM international conference on web search and data mining. 108\u2013116","key":"11665_CR8","DOI":"10.1145\/3159652.3159668"},{"doi-asserted-by":"crossref","unstructured":"C Ma, L Ma, Y Zhang, J Sun, X Liu, M Coates (2020) Memory augmented graph neural networks for sequential recommendation. In: Proceedings of the AAAI conference on artificial intelligence. 34(04): 5045-5052","key":"11665_CR9","DOI":"10.1609\/aaai.v34i04.5945"},{"doi-asserted-by":"crossref","unstructured":"F Sun et al., (2019) BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In: Proceedings of the 28th ACM international conference on information and knowledge management. 1441\u20131450","key":"11665_CR10","DOI":"10.1145\/3357384.3357895"},{"doi-asserted-by":"crossref","unstructured":"Q Chen, H Zhao, W Li, P Huang, W Ou (2019) Behavior sequence transformer for e-commerce recommendation in alibaba. In: Proceedings of the 1st International Workshop on Deep Learning Practice for High-Dimensional Sparse Data. 1\u20134","key":"11665_CR11","DOI":"10.1145\/3326937.3341261"},{"issue":"4","key":"11665_CR12","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1007\/s11063-022-11053-8","volume":"55","author":"YH Xu","year":"2022","unstructured":"Xu YH, Zh Wang ZR, Fan R, Wang X (2022) A recommendation algorithm based on a self-supervised learning pretrain transformer. Neural Process Lett 55(4):4481\u20134497","journal-title":"Neural Process Lett"},{"doi-asserted-by":"crossref","unstructured":"W Meng, D Yang, Y Xiao (2020) Incorporating user micro-behaviors and item knowledge into multi-task learning for session-based recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in Information Retrieval. 1091\u20131100","key":"11665_CR13","DOI":"10.1145\/3397271.3401098"},{"doi-asserted-by":"crossref","unstructured":"C Hsu, CT Li (2021) RetaGNN: Relational temporal attentive graph neural networks for holistic sequential recommendation. In: Proceedings of the Web Conference 2021. 2968-2979","key":"11665_CR14","DOI":"10.1145\/3442381.3449957"},{"issue":"5","key":"11665_CR15","doi-asserted-by":"publisher","first-page":"4751","DOI":"10.1007\/s40747-023-00974-z","volume":"9","author":"Y Xu","year":"2023","unstructured":"Xu Y et al (2023) SimDCL: dropout-based simple graph contrastive learning for recommendation. Complex Intell Syst 9(5):4751\u20134763","journal-title":"Complex Intell Syst"},{"doi-asserted-by":"crossref","unstructured":"Z Fu et al., (2020) Fairness-aware explainable recommendation over knowledge graphs. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 69\u201378","key":"11665_CR16","DOI":"10.1145\/3397271.3401051"},{"issue":"1","key":"11665_CR17","first-page":"1","volume":"42","author":"Z Xu","year":"2023","unstructured":"Xu Z, Zeng H, Tan J, Fu Z, Zhang Y, Ai Q (2023) A Reusable model-agnostic framework for faithfully explainable recommendation and system scrutability. ACM Trans Inf Syst 42(1):1\u201329","journal-title":"ACM Trans Inf Syst"},{"doi-asserted-by":"crossref","unstructured":"G Balloccu, L Boratto, G Fenu, M Marras (2022) Hands on explainable recommender systems with knowledge graphs. In: Proceedings of the 16th ACM Conference on Recommender Systems. 710\u2013713","key":"11665_CR18","DOI":"10.1145\/3523227.3547374"},{"doi-asserted-by":"crossref","unstructured":"Q Guo, Z Sun, YL Theng (2019) Exploiting side information for recommendation. In: International Conference on Web Engineering. 569\u2013573: Springer.","key":"11665_CR19","DOI":"10.1007\/978-3-030-19274-7_46"},{"doi-asserted-by":"crossref","unstructured":"HT Cheng et al., (2016) Wide & deep learning for recommender systems. In: Proceedings of the 1st workshop on deep learning for recommender systems. 7\u201310","key":"11665_CR20","DOI":"10.1145\/2988450.2988454"},{"doi-asserted-by":"crossref","unstructured":"R Wang et al., (2021) Dcn v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems. In: Proceedings of the Web Conference 2021. 1785-1797","key":"11665_CR21","DOI":"10.1145\/3442381.3450078"},{"doi-asserted-by":"crossref","unstructured":"D Ding, M Zhang, SY Li, J Tang, X Chen, ZH Zhou (2017) Baydnn: Friend recommendation with bayesian personalized ranking deep neural network. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1479\u20131488","key":"11665_CR22","DOI":"10.1145\/3132847.3132941"},{"doi-asserted-by":"crossref","unstructured":"W Fan et al., (2019) Graph neural networks for social recommendation. In: The world wide web conference. 417\u2013426","key":"11665_CR23","DOI":"10.1145\/3308558.3313488"},{"doi-asserted-by":"crossref","unstructured":"F Zhang, NJ Yuan, D Lian, X Xie, WY Ma (2016) Collaborative knowledge base embedding for recommender systems. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. 353\u2013362","key":"11665_CR24","DOI":"10.1145\/2939672.2939673"},{"doi-asserted-by":"crossref","unstructured":"Y Zhang, Q Ai, X Chen, WB Croft (2017) Joint representation learning for top-n recommendation with heterogeneous information sources. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1449\u20131458.","key":"11665_CR25","DOI":"10.1145\/3132847.3132892"},{"issue":"2","key":"11665_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3291060","volume":"37","author":"Z Cheng","year":"2019","unstructured":"Cheng Z, Chang X, Zhu L, Kanjirathinkal RC, Kankanhalli M (2019) MMALFM: Explainable recommendation by leveraging reviews and images. ACM Trans Inf Syst (TOIS) 37(2):1\u201328","journal-title":"ACM Trans Inf Syst (TOIS)"},{"doi-asserted-by":"crossref","unstructured":"H Wang, M Zhao, X Xie, W Li, M Guo (2019) Knowledge graph convolutional networks for recommender systems. In: The World Wide Web Conference. 3307\u20133313","key":"11665_CR27","DOI":"10.1145\/3308558.3313417"},{"doi-asserted-by":"crossref","unstructured":"WX Zhao et al., (2021) Recbole: Towards a unified, comprehensive and efficient framework for recommendation algorithms. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 4653\u20134664","key":"11665_CR28","DOI":"10.1145\/3459637.3482016"},{"doi-asserted-by":"crossref","unstructured":"W Du, G Jiang, W Xu, J Ma (2021) Sequential patent trading recommendation using knowledge-aware attentional bidirectional long short-term memory network (KBiLSTM). 01655515211023937","key":"11665_CR29","DOI":"10.1177\/01655515211023937"},{"key":"11665_CR30","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"Q Guo","year":"2020","unstructured":"Guo Q et al (2020) A survey on knowledge graph-based recommender systems. IEEE Trans Knowl Data Eng 34:3549\u20133568","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"11665_CR31","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TNNLS.2021.3070843","volume":"33","author":"S Ji","year":"2021","unstructured":"Ji S, Pan S, Cambria E, Marttinen P, Philip SY (2021) A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans Neural Netw Learn Syst 33(2):494\u2013514","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"doi-asserted-by":"crossref","unstructured":"X Wang, D Wang, C Xu, X He, Y Cao, TS Chua (2018) Explainable Reasoning over Knowledge Graphs for Recommendation. In: AAAI Conference on Artificial Intelligence.","key":"11665_CR32","DOI":"10.1609\/aaai.v33i01.33015329"},{"unstructured":"A Bordes, N Usunier, A Garcia-Duran, J Weston, O Yakhnenko (2013) Translating embeddings for modeling multi-relational data. Advances in neural information processing systems. 26.","key":"11665_CR33"},{"key":"11665_CR34","first-page":"1","volume":"29","author":"Y Lin","year":"2015","unstructured":"Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. In Twenty-ninth AAAI conference on artificial intelligence 29:1","journal-title":"In Twenty-ninth AAAI conference on artificial intelligence"},{"doi-asserted-by":"crossref","unstructured":"T. Dettmers, P. Minervini, P. Stenetorp, and S. Riedel, (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI conference on artificial intelligence. vol. 32: 1","key":"11665_CR35","DOI":"10.1609\/aaai.v32i1.11573"},{"doi-asserted-by":"crossref","unstructured":"L Chao, J He, T Wang, W Chu (2020) PairRE: Knowledge graph embeddings via paired relation vectors. arXiv, vol. 03798","key":"11665_CR36","DOI":"10.18653\/v1\/2021.acl-long.336"},{"doi-asserted-by":"crossref","unstructured":"X Ge, YC Wang, B Wang, CCJ Kuo (2023) Compounding geometric operations for knowledge graph completion. In: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 6947\u20136965","key":"11665_CR37","DOI":"10.18653\/v1\/2023.acl-long.384"},{"doi-asserted-by":"crossref","unstructured":"G. Ji, S. He, L. Xu, K. Liu, and J. Zhao, (2015) Knowledge graph embedding via dynamic mapping matrix. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (volume 1: Long papers). pp. 687\u2013696","key":"11665_CR38","DOI":"10.3115\/v1\/P15-1067"},{"doi-asserted-by":"crossref","unstructured":"H. Wang et al., (2018) Ripplenet: Propagating user preferences on the knowledge graph for recommender systems. In: Proceedings of the 27th ACM international conference on information and knowledge management. pp. 417\u2013426","key":"11665_CR39","DOI":"10.1145\/3269206.3271739"},{"doi-asserted-by":"crossref","unstructured":"X. Wang, X. He, Y. Cao, M. Liu, and T.-S. Chua, (2019) Kgat: Knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 950\u2013958","key":"11665_CR40","DOI":"10.1145\/3292500.3330989"},{"unstructured":"Y. Goldberg and O. Levy, (2014) word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method. arXiv, vol. abs\/1402.3722","key":"11665_CR41"},{"unstructured":"X. Rong, (2014) Word2vec Parameter Learning Explained. arXiv, vol. abs\/1411.2738","key":"11665_CR42"},{"key":"11665_CR43","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s10489-021-02363-w","volume":"52","author":"B Hui","year":"2021","unstructured":"Hui B, Zhang L, Zhou X, Wen X, Nian Y (2021) Personalized recommendation system based on knowledge embedding and historical behavior. Appl Intell 52:954\u2013966","journal-title":"Appl Intell"},{"unstructured":"P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, (2017) Graph Attention Networks. arXiv, vol. abs\/1710.10903","key":"11665_CR44"},{"key":"11665_CR45","first-page":"1","volume":"30","author":"A Vaswani","year":"2017","unstructured":"Vaswani A et al (2017) Attention is all you need. Adv neural inf process syst 30:1","journal-title":"Adv neural inf process syst"},{"doi-asserted-by":"crossref","unstructured":"G Zhou et al., (2018) Deep interest network for click-through rate prediction. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. pp. 1059\u20131068.","key":"11665_CR46","DOI":"10.1145\/3219819.3219823"},{"doi-asserted-by":"crossref","unstructured":"X. Fan, Z. Liu, J. Lian, W. X. Zhao, X. Xie, and J.-R. Wen, (2021) Lighter and better: low-rank decomposed self-attention networks for next-item recommendation. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp. 1733\u20131737","key":"11665_CR47","DOI":"10.1145\/3404835.3462978"},{"unstructured":"M Naumov (2019) On the Dimensionality of Embeddings for Sparse Features and Data. arXiv, vol. abs\/1901.02103","key":"11665_CR48"},{"unstructured":"Z Yin, Y Shen (2018) On the dimensionality of word embedding. Advances in neural information processing systems. vol. 31","key":"11665_CR49"},{"doi-asserted-by":"crossref","unstructured":"C Szegedy et al., (2014) Going deeper with convolutions. IEEE Conference on Computer Vision and Pattern Recognition. pp. 1\u20139,.","key":"11665_CR50","DOI":"10.1109\/CVPR.2015.7298594"},{"doi-asserted-by":"crossref","unstructured":"R Wang, B Fu, G Fu, M Wang (2017) Deep & cross network for ad click predictions. In: Proceedings of the ADKDD'17, pp. 1\u20137","key":"11665_CR51","DOI":"10.1145\/3124749.3124754"},{"issue":"8","key":"11665_CR52","doi-asserted-by":"publisher","first-page":"3961","DOI":"10.1109\/TNNLS.2021.3055147","volume":"33","author":"Z Li","year":"2021","unstructured":"Li Z, Liu H, Zhang Z, Liu T, Xiong NN (2021) Learning knowledge graph embedding with heterogeneous relation attention networks. IEEE Trans Neural Netw Learn Syst 33(8):3961\u20133973","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11665-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s11063-024-11665-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s11063-024-11665-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T16:09:20Z","timestamp":1725120560000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/10.1007\/s11063-024-11665-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,28]]},"references-count":52,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["11665"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1007\/s11063-024-11665-2","relation":{},"ISSN":["1573-773X"],"issn-type":[{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2024,6,28]]},"assertion":[{"value":"3 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 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":"No funding was received to assist with the preparation of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"207"}}