Category-guided multi-interest collaborative metric learning with representation uniformity constraints

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Long Wang, Tao Lian
{"title":"Category-guided multi-interest collaborative metric learning with representation uniformity constraints","authors":"Long Wang,&nbsp;Tao Lian","doi":"10.1016/j.ipm.2024.103937","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-interest collaborative metric learning has recently emerged as an effective approach to modeling the multifaceted interests of a user in recommender systems. However, two issues remain unexplored. (1) There is no explicit guidance for the matching of an item against multiple interest vectors of a user. (2) The desired property of item representations with respect to their categories is overlooked, resulting in that different categories of items are mixed up in the latent space. To overcome these issues, we devise a Category-guided Multi-interest Collaborative Metric Learning model (CMCML) with representation uniformity constraints. CMCML is designed as a novel category-guided Mixture-of-Experts (MoE) architecture, where the gating network leverages the item category to guide the matching of an item against multiple interest vectors of a user, encouraging items with the same category to approach the same interest vector. In addition, we design a user multi-interest uniformity loss and a category-aware item uniformity loss: The former aims to avoid representation degeneration by enlarging the difference among multiple interest vectors of the same user; the latter is tailored to push different categories of items apart in the latent space. Quantitative experiments on Ciao, Epinions and TaFeng demonstrate that our CMCML improves the value of NDCG@20 by 12.41%, 10.89% and 10.39% respectively, compared to other state-of-the-art collaborative metric learning methods. Further qualitative analyses reveal that our CMCML yields a better representation space where items from distinct categories are arranged in different regions with high density.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-10-24","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/S0306457324002966","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

Multi-interest collaborative metric learning has recently emerged as an effective approach to modeling the multifaceted interests of a user in recommender systems. However, two issues remain unexplored. (1) There is no explicit guidance for the matching of an item against multiple interest vectors of a user. (2) The desired property of item representations with respect to their categories is overlooked, resulting in that different categories of items are mixed up in the latent space. To overcome these issues, we devise a Category-guided Multi-interest Collaborative Metric Learning model (CMCML) with representation uniformity constraints. CMCML is designed as a novel category-guided Mixture-of-Experts (MoE) architecture, where the gating network leverages the item category to guide the matching of an item against multiple interest vectors of a user, encouraging items with the same category to approach the same interest vector. In addition, we design a user multi-interest uniformity loss and a category-aware item uniformity loss: The former aims to avoid representation degeneration by enlarging the difference among multiple interest vectors of the same user; the latter is tailored to push different categories of items apart in the latent space. Quantitative experiments on Ciao, Epinions and TaFeng demonstrate that our CMCML improves the value of NDCG@20 by 12.41%, 10.89% and 10.39% respectively, compared to other state-of-the-art collaborative metric learning methods. Further qualitative analyses reveal that our CMCML yields a better representation space where items from distinct categories are arranged in different regions with high density.
具有表征统一性约束的分类指导多兴趣协作度量学习
多兴趣协作度量学习最近已成为推荐系统中模拟用户多方面兴趣的一种有效方法。然而,有两个问题仍有待探索。(1) 没有明确的指南来指导如何将一个项目与用户的多个兴趣向量进行匹配。(2) 忽视了项目表征在其类别方面的理想属性,导致不同类别的项目在潜在空间中混杂在一起。为了克服这些问题,我们设计了一种具有表征统一性约束的类别引导多兴趣协作度量学习模型(CMCML)。CMCML 被设计为一种新颖的类别引导专家混合物(MoE)架构,其中门控网络利用项目类别来引导项目与用户的多个兴趣向量进行匹配,鼓励具有相同类别的项目接近相同的兴趣向量。此外,我们还设计了用户多兴趣一致性损失和类别感知的项目一致性损失:前者的目的是通过扩大同一用户多个兴趣向量之间的差异来避免表征退化;后者则是为了在潜在空间中将不同类别的项目区分开来。在 Ciao、Epinions 和 TaFeng 上进行的定量实验表明,与其他最先进的协作度量学习方法相比,我们的 CMCML 将 NDCG@20 的值分别提高了 12.41%、10.89% 和 10.39%。进一步的定性分析显示,我们的 CMCML 能够产生更好的表示空间,不同类别的项目被高密度地排列在不同的区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
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学术官方微信