User group-enhanced user feature distribution transfer framework for non-overlapping cross-domain recommendations

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xiaoying Gao, Ling Ding, Jianting Chen, Yunxiao Yang, Yang Xiang
{"title":"User group-enhanced user feature distribution transfer framework for non-overlapping cross-domain recommendations","authors":"Xiaoying Gao,&nbsp;Ling Ding,&nbsp;Jianting Chen,&nbsp;Yunxiao Yang,&nbsp;Yang Xiang","doi":"10.1016/j.knosys.2025.113186","DOIUrl":null,"url":null,"abstract":"<div><div>Cross-domain recommendation (CDR) aims to alleviate data sparsity in the target domain by leveraging rich information from source domains. Most existing approaches rely on overlapping information to transfer knowledge, but in real scenarios, these correspondences are often unknown. This makes it critical to develop CDR systems without overlapping information. However, such CDR systems still face user feature bias between domains and ignore the importance of sparse interaction information from the target domain, resulting in sub-optimal recommendations performance. To address challenges, we propose a <strong>U</strong>ser <strong>G</strong>roup-enhanced <strong>U</strong>ser <strong>F</strong>eature <strong>D</strong>istribution <strong>T</strong>ransfer framework (UGUFDT) for CDR. Specifically, it first utilizes a User Feature Separation Network bridges domains by constructing a cross-domain user–cluster graph to capture transferable user features, while User Feature Reconstructor refines unbiased user representations through reconstruction factors to build an inverse user–cluster graph, filter out source domain-specific noises. Then, we introduce three types of loss function – <em>Difference Loss</em>, <em>Similarity Loss</em>, <em>Reconstruction Loss</em> – to reduce feature distribution discrepancies between domains. Furthermore, to fully exploit interactions in target domain, we propose a User–Group Graph with a Soft Allocation Mechanism, which aggregates group-level preferences to enhance user representations. Finally, a Prediction Layer with a Fusion Mechanism integrates both cross-domain transferable knowledge and target-domain preferences to generate more accurate recommendations. Experiments on three publicly available datasets – ML, AB, and AM – demonstrate that the proposed model significantly outperforms state-of-the-art models on the HR and NDCG evaluation metrics, validating the effectiveness of our model.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"314 ","pages":"Article 113186"},"PeriodicalIF":7.2000,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125002333","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Cross-domain recommendation (CDR) aims to alleviate data sparsity in the target domain by leveraging rich information from source domains. Most existing approaches rely on overlapping information to transfer knowledge, but in real scenarios, these correspondences are often unknown. This makes it critical to develop CDR systems without overlapping information. However, such CDR systems still face user feature bias between domains and ignore the importance of sparse interaction information from the target domain, resulting in sub-optimal recommendations performance. To address challenges, we propose a User Group-enhanced User Feature Distribution Transfer framework (UGUFDT) for CDR. Specifically, it first utilizes a User Feature Separation Network bridges domains by constructing a cross-domain user–cluster graph to capture transferable user features, while User Feature Reconstructor refines unbiased user representations through reconstruction factors to build an inverse user–cluster graph, filter out source domain-specific noises. Then, we introduce three types of loss function – Difference Loss, Similarity Loss, Reconstruction Loss – to reduce feature distribution discrepancies between domains. Furthermore, to fully exploit interactions in target domain, we propose a User–Group Graph with a Soft Allocation Mechanism, which aggregates group-level preferences to enhance user representations. Finally, a Prediction Layer with a Fusion Mechanism integrates both cross-domain transferable knowledge and target-domain preferences to generate more accurate recommendations. Experiments on three publicly available datasets – ML, AB, and AM – demonstrate that the proposed model significantly outperforms state-of-the-art models on the HR and NDCG evaluation metrics, validating the effectiveness of our model.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信