User identification network with contrastive clustering for shared-account recommendation

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2025-01-15 DOI:10.1016/j.ipm.2024.104055
Xinhua Wang , Houping Yue , Lei Guo , Feng Guo , Chen He , Xiaohui Han
{"title":"User identification network with contrastive clustering for shared-account recommendation","authors":"Xinhua Wang ,&nbsp;Houping Yue ,&nbsp;Lei Guo ,&nbsp;Feng Guo ,&nbsp;Chen He ,&nbsp;Xiaohui Han","doi":"10.1016/j.ipm.2024.104055","DOIUrl":null,"url":null,"abstract":"<div><div>The Shared-Account Recommendation (SAR) aims to accurately identify and accommodate the varied preferences of multiple users sharing a single account by analyzing their aggregated interactions. SAR faces challenges in preference identification when multiple users share an account. Existing Shared-Account Modeling (SAM) methods assume overly simplistic conditions and overlook the robustness of representations, leading to inaccurate embeddings that are susceptible to disturbances. To address limitations in existing SAR methods, we introduce the <strong>C</strong>ontrastive <strong>C</strong>lustering <strong>U</strong>ser <strong>I</strong>dentification Network (CCUI-Net) framework to enhance SAR. This framework employs graph-based transformations and node representation learning to refine user embeddings, utilizes hierarchical contrastive clustering for improved user identification and robustness against data noise, and leverages an attention mechanism to dynamically balance contributions from various users. These innovations significantly boost the precision and reliability of recommendations. Experimental results across four domains from the HVIDEO and HAMAZON datasets (E-domain and V-domain in HVIDEO, M-domain and B-domain in HAMAZON) demonstrate that CCUI-Net exceeds the performance of many existing available methods on the metrics MRR@5, MRR@20, Recall@5, and Recall@20. Specifically, the improvements in the M-domain and B-domain for Recall@5 and Recall@20 are 14.64%, 8.55%, 18.67%, and 9.59% respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 3","pages":"Article 104055"},"PeriodicalIF":7.4000,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030645732400414X","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The Shared-Account Recommendation (SAR) aims to accurately identify and accommodate the varied preferences of multiple users sharing a single account by analyzing their aggregated interactions. SAR faces challenges in preference identification when multiple users share an account. Existing Shared-Account Modeling (SAM) methods assume overly simplistic conditions and overlook the robustness of representations, leading to inaccurate embeddings that are susceptible to disturbances. To address limitations in existing SAR methods, we introduce the Contrastive Clustering User Identification Network (CCUI-Net) framework to enhance SAR. This framework employs graph-based transformations and node representation learning to refine user embeddings, utilizes hierarchical contrastive clustering for improved user identification and robustness against data noise, and leverages an attention mechanism to dynamically balance contributions from various users. These innovations significantly boost the precision and reliability of recommendations. Experimental results across four domains from the HVIDEO and HAMAZON datasets (E-domain and V-domain in HVIDEO, M-domain and B-domain in HAMAZON) demonstrate that CCUI-Net exceeds the performance of many existing available methods on the metrics MRR@5, MRR@20, Recall@5, and Recall@20. Specifically, the improvements in the M-domain and B-domain for Recall@5 and Recall@20 are 14.64%, 8.55%, 18.67%, and 9.59% respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Injecting new insights: How do review sentiment and rating inconsistency shape the helpfulness of airline reviews? Exploring hate speech dynamics: The emotional, linguistic, and thematic impact on social media users Leveraging LLMs for action item identification in Urdu meetings: Dataset creation and comparative analysis Deep multi-view subspace clustering via hierarchical diversity optimization of consensus learning TK-RNSP: Efficient Top-K Repetitive Negative Sequential Pattern mining
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1