{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T08:02:29Z","timestamp":1774252949521,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Natural Science Foundation of China Major Projects","award":["No.62137001"],"award-info":[{"award-number":["No.62137001"]}]},{"DOI":"10.13039\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["grant. 2024ZD0608200"],"award-info":[{"award-number":["grant. 2024ZD0608200"]}],"id":[{"id":"10.13039\/501100018537","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":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Knowledge graph-based recommendation systems have strong capabilities in deep association mining and structured reasoning, which effectively alleviate data sparsity and cold-start problems in recommendation. However, traditional knowledge graph-based recommendation considers each graph relation in isolation, failing to capture the potential semantic correlations between different relation types, which leads to incomplete semantic representations. In addition, existing methods generally ignore negative feedback signals in users\u2019 historical interactions, resulting in biased preference modeling. To overcome the above challenges, we introduce\n                    <jats:bold>S<\/jats:bold>\n                    ign-aware\n                    <jats:bold>R<\/jats:bold>\n                    ecommendation based on\n                    <jats:bold>V<\/jats:bold>\n                    irtual\n                    <jats:bold>S<\/jats:bold>\n                    emantic\n                    <jats:bold>K<\/jats:bold>\n                    nowledge\n                    <jats:bold>G<\/jats:bold>\n                    raph(SRVSKG), which enhances recommendation performance by combining virtual semantic collaborative representations with sign-aware learning techniques. Firstly, we propose a virtual semantic subgraph collaborative representation module to learn user and item embeddings. In this module, we build virtual semantic subgraphs through relation clustering based on latent semantic similarity measurement. Then a hierarchical feature extraction mechanism based on graph attention network is applied to virtual semantic subgraphs, which captures semantic associations across relations and enriches item embedding. At the same time, we emphasize user preference for attributes to enrich user embedding. Secondly, we design a sign-aware learning module, which constructs a user-item signed graph, applies Laplacian matrix factorization to simultaneously model the topological features of positive and negative feedback, and introduces the transformer architecture to dynamically fuse signed information, effectively utilizing negative feedback information to eliminate bias in user preference modeling. Finally, we establish a multi-feature fusion mechanism that deeply combines features from the virtual semantic subgraph collaborative representation module and the sign-aware learning module to enable recommendation. Experiment results on three public datasets demonstrate that SRVSKG outperforms state-of-the-art recommendation baselines.\n                  <\/jats:p>","DOI":"10.1007\/s41019-025-00319-5","type":"journal-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T06:19:47Z","timestamp":1763360387000},"page":"100-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sign-aware Recommendation Based on Virtual Semantic Knowledge Graph"],"prefix":"10.1007","volume":"11","author":[{"given":"Shenggen","family":"Ju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9599-7248","authenticated-orcid":false,"given":"Tianyu","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongmei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieping","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,17]]},"reference":[{"key":"319_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.113109","volume":"311","author":"F Yang","year":"2025","unstructured":"Yang F, Du H, Zhang X, Yang Y, Wang Y (2025) Self-supervised category-enhanced graph neural networks for recommendation. Knowl-Based Syst 311:113109","journal-title":"Knowl-Based Syst"},{"key":"319_CR2","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua TS (2017) Neural collaborative filtering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"319_CR3","doi-asserted-by":"crossref","unstructured":"Wang H, Wang J, Zhao M, Cao J, Guo, M (2017) Joint topic-semantic-aware social recommendation for online voting. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 347\u2013356","DOI":"10.1145\/3132847.3132889"},{"key":"319_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.129539","author":"C Yu","year":"2025","unstructured":"Yu C, Zhao J, Wu X, Luo Y, Xiao Y (2025) Tpgrec: text-enhanced and popularity-smoothing graph collaborative filtering for long-tail item recommendation. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2025.129539","journal-title":"Neurocomputing"},{"key":"319_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tsep.2025.103390","volume":"59","author":"M Li","year":"2025","unstructured":"Li M (2025) Optimization of artificial intelligence recommendation algorithm based on knowledge graph and machine learning: computer thermal optimization. Therm Sci Eng Prog 59:103390","journal-title":"Therm Sci Eng Prog"},{"key":"319_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.112633","volume":"169","author":"X Wang","year":"2025","unstructured":"Wang X, Zhang Z, Shen G, Lai S, Chen Y, Zhu S (2025) Multi-view knowledge graph convolutional networks for recommendation. Appl Soft Comput 169:112633","journal-title":"Appl Soft Comput"},{"key":"319_CR7","first-page":"1","volume":"9","author":"L Xie","year":"2021","unstructured":"Xie L, Hu Z, Cai X, Zhang W, Chen J (2021) Explainable recommendation based on knowledge graph and multi-objective optimization. Complex Intell Syst 9:1\u201312","journal-title":"Complex Intell Syst"},{"issue":"May","key":"319_CR8","first-page":"1","volume":"115","author":"Z Lin","year":"2023","unstructured":"Lin Z, Qu L (2023) Collaborative knowledge-aware recommendation based on neighborhood negative sampling. Inf Syst 115(May):1\u2013119","journal-title":"Inf Syst"},{"issue":"1","key":"319_CR9","doi-asserted-by":"publisher","DOI":"10.3390\/fi16010012","volume":"16","author":"X Li","year":"2024","unstructured":"Li X, Henriksson A, Duneld M, Nouri J, Wu Y (2024) Evaluating embeddings from pre-trained language models and knowledge graphs for educational content recommendation. Future Internet 16(1):12","journal-title":"Future Internet"},{"key":"319_CR10","doi-asserted-by":"crossref","unstructured":"Sardina J, Kelleher JD, O\u2019Sullivan D (2024) Twig: Towards pre-hoc hyperparameter optimisation and cross-graph generalisation via simulated kge models. IEEE","DOI":"10.1109\/ICSC59802.2024.00025"},{"key":"319_CR11","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Curran Associates Inc"},{"key":"319_CR12","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) nowledge graph embedding by translating on hyperplanes. In: National Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"319_CR13","doi-asserted-by":"crossref","unstructured":"Ji G, He S, Xu L, Liu K, Zhao J (2015) nowledge graph embedding via dynamic mapping matrix. In: Meeting of the Association for Computational Linguistics & the International Joint Conference on Natural Language Processing","DOI":"10.3115\/v1\/P15-1067"},{"key":"319_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.procs.2017.05.045","volume":"108","author":"H Lin","year":"2017","unstructured":"Lin H, Liu Y, Wang W, Yue Y, Lin Z (2017) Learning entity and relation embeddings for knowledge resolution. Procedia Comput Sci 108:345\u2013354","journal-title":"Procedia Comput Sci"},{"issue":"01","key":"319_CR15","doi-asserted-by":"publisher","first-page":"5329","DOI":"10.1609\/aaai.v33i01.33015329","volume":"33","author":"X Wang","year":"2019","unstructured":"Wang X, Wang D, Xu C, He X, Chua TS (2019) Explainable reasoning over knowledge graphs for recommendation. Proceedings of the AAAI Conference on Artificial Intelligence 33(01):5329\u20135336","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"319_CR16","doi-asserted-by":"crossref","unstructured":"Ma W, Zhang M, Cao Y, Jin W, Wang C (2019) Jointly learning explainable rules for recommendation with knowledge graph","DOI":"10.1145\/3308558.3313607"},{"key":"319_CR17","doi-asserted-by":"crossref","unstructured":"Xian Y, Fu Z, Muthukrishnan S, Melo GD, Zhang Y (2019) Reinforcement knowledge graph reasoning for explainable recommendation. ACM","DOI":"10.1145\/3331184.3331203"},{"key":"319_CR18","doi-asserted-by":"crossref","unstructured":"Lu L, Wang B, Zhang Z, Liu S, Xu H (2023) Vrkg4rec: virtual relational knowledge graph for recommendation. In: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, pp. 526\u2013534","DOI":"10.1145\/3539597.3570482"},{"key":"319_CR19","doi-asserted-by":"crossref","unstructured":"Wang X, Huang T, Wang D, Yuan Y, Chua TS (2021) Learning intents behind interactions with knowledge graph for recommendation","DOI":"10.1145\/3442381.3450133"},{"key":"319_CR20","doi-asserted-by":"crossref","unstructured":"Chen Y, Yang Y, Wang Y, Bai J, Song X (2021) King I Attentive knowledge-aware graph convolutional networks with collaborative guidance for personalized recommendation","DOI":"10.1109\/ICDE53745.2022.00027"},{"key":"319_CR21","unstructured":"Li Z, Liu H, Zhang Z, Liu T, Xiong NN (2021) Learning knowledge graph embedding with heterogeneous relation attention networks. IEEE Transactions on Neural Networks and Learning Systems PP(99)"},{"key":"319_CR22","doi-asserted-by":"crossref","unstructured":"Zhao J, Zhou Z, Guan Z, Zhao W, Ning W, Qiu G, He X (2019) DSIntentgc: a scalable graph convolution framework fusing heterogeneous information for recommendation. ACM","DOI":"10.1145\/3292500.3330686"},{"key":"319_CR23","doi-asserted-by":"crossref","unstructured":"Qu Y, Bai T, Zhang W, Nie J, Tang J (2019) An end-to-end neighborhood-based interaction model for knowledge-enhanced recommendation. In: Proceedings of the 1st International Workshop on Deep Learning Practice for High-dimensional Sparse Data, pp. 1\u20139","DOI":"10.1145\/3326937.3341257"},{"issue":"66","key":"319_CR24","first-page":"1111","volume":"2","author":"C Jinpeng","year":"2024","unstructured":"Jinpeng C, Haiyang L, Xudong Z, Fan Z, Senzhang W, Kaimin W, Jiaqi J (2024) Sr-hetgnn: session-based recommendation with heterogeneous graph neural network. Knowl Inf Syst 2(66):1111\u20131134","journal-title":"Knowl Inf Syst"},{"key":"319_CR25","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Cao Y, Liu M, Chua TS (2019) Kgat: Knowledge graph attention network for recommendation. ACM","DOI":"10.1145\/3292500.3330989"},{"issue":"3","key":"319_CR26","doi-asserted-by":"publisher","first-page":"2717","DOI":"10.1007\/s00521-022-07689-1","volume":"35","author":"Y Liu","year":"2023","unstructured":"Liu Y, Miyazaki J (2023) Knowledge-aware attentional neural network for review-based movie recommendation with explanations. Neural Comput Appl 35(3):2717\u20132735","journal-title":"Neural Comput Appl"},{"key":"319_CR27","doi-asserted-by":"publisher","unstructured":"Liu X, Li X, Cao Y, Zhang F, Jin X, Chen JMandari: (2023) Multi-modal temporal knowledge graph-aware sub-graph embedding for next-poi recommendation. In: 2023 IEEE International Conference on Multimedia and Expo (ICME), pp. 1529\u20131534 . https:\/\/doi.org\/10.1109\/ICME55011.2023.00264","DOI":"10.1109\/ICME55011.2023.00264"},{"key":"319_CR28","doi-asserted-by":"crossref","unstructured":"Huang J, Shen H, Cao Q, Tao S, Cheng X (2021) Signed bipartite graph neural networks","DOI":"10.1145\/3459637.3482392"},{"key":"319_CR29","unstructured":"Liu Z, Wang C, Xu J, Wu C, Zheng K, Song Y, Mou N, Gai K (2023) Pane-gnn: Unifying positive and negative edges in graph neural networks for recommendation. arXiv preprint arXiv:2306.04095"},{"key":"319_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103403","volume":"60","author":"J Huang","year":"2023","unstructured":"Huang J, Xie R, Cao Q, Shen H, Zhang S, Xia F, Cheng X (2023) Negative can be positive: signed graph neural networks for recommendation. Inf Process Manag 60:103403","journal-title":"Inf Process Manag"},{"key":"319_CR31","first-page":"4444","volume":"37","author":"Y Li","year":"2023","unstructured":"Li Y, Qu M, Tang J, Chang Y (2023) Signed laplacian graph neural networks. Proc AAAI Conf Artif Intell 37:4444\u20134452","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"319_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2025.103154","volume":"122","author":"J Chen","year":"2025","unstructured":"Chen J, Wang J, Zhang F, Cao Y, Wei K, Huang L, Zhu H, Kou F, Huang H (2025) Dual-view collaboration fusion on diffusion learning for bundle recommendation. Inf Fusion 122:103154","journal-title":"Inf Fusion"},{"key":"319_CR33","doi-asserted-by":"publisher","unstructured":"Chen J, Cao Y, Zhang F, Sun P, Wei K (2022) Sequential intention-aware recommender based on user interaction graph. In: Proceedings of the 2022 International Conference on Multimedia Retrieval. ICMR \u201922, pp. 118\u2013126. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3512527.3531390 .","DOI":"10.1145\/3512527.3531390"},{"key":"319_CR34","unstructured":"Nikiforov V (2010) Spectral graph theory"},{"issue":"3","key":"319_CR35","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"DI Shuman","year":"2013","unstructured":"Shuman DI, Narang SK, Frossard P, Ortega A, Vandergheynst P (2013) The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process Mag 30(3):83\u201398","journal-title":"IEEE Signal Process Mag"},{"key":"319_CR36","doi-asserted-by":"crossref","unstructured":"Chen S, Chen J, Zhou S, Wang B, Han S, Su C, Yuan Y, Wang C (2024) Sigformer: Sign-aware graph ransformer for recommendation. In: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1274\u20131284","DOI":"10.1145\/3626772.3657747"},{"key":"319_CR37","unstructured":"Dosovitskiy A, Beyer L, Kolesnikov A, Weissenborn D, Zhai X, Unterthiner T, Dehghani M, Minderer M, Heigold G, Gelly S (2021) An image is worth 16x16 words: Transformers for image recognition at scale. In: International Conference on Learning Representations"},{"issue":"5","key":"319_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-025-06257-z","volume":"55","author":"Y Zuo","year":"2025","unstructured":"Zuo Y, Zhang Y, Zhang Q, Zhang W (2025) Knowledge-aware recommendation based on hypergraph representation learning and transformer model optimization. Appl Intell 55(5):1\u201317","journal-title":"Appl Intell"},{"key":"319_CR39","doi-asserted-by":"crossref","unstructured":"Rendle S, Gantner Z, Freudenthaler C (2011) Schmidt-Thieme, L.: Fast context-aware recommendations with factorization machines. In: International Acm Sigir Conference on Research & Development in Information Retrieval, p. 635","DOI":"10.1145\/2009916.2010002"},{"issue":"(cd)","key":"319_CR40","first-page":"355","volume":"51","author":"X He","year":"2017","unstructured":"He X, Chua TS (2017) Neural factorization machines for sparse predictive analytics. ACM SIGIR FORUM 51((cd)):355\u2013364","journal-title":"ACM SIGIR FORUM"},{"key":"319_CR41","doi-asserted-by":"crossref","unstructured":"Zou D, Wei W, Zhu F, Xu C, Zhang T, Huo C (2024) nowledge enhanced multi-intent transformer network for recommendation. In: Companion Proceedings of the ACM Web Conference 2024, pp. 1\u20139","DOI":"10.1145\/3589335.3648296"},{"issue":"4","key":"319_CR42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3175772","volume":"35","author":"C Seo","year":"2024","unstructured":"Seo C, Jeong KJ, Lim S, Shin WY (2024) Siren: sign-aware recommendation using graph neural networks. IEEE Trans Neural Netw Learn Syst 35(4):15","journal-title":"IEEE Trans Neural Netw Learn Syst"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00319-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00319-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00319-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:18:26Z","timestamp":1774250306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00319-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,17]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["319"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00319-5","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,17]]},"assertion":[{"value":"17 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 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":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}