{"title":"具有表征统一性约束的分类指导多兴趣协作度量学习","authors":"Long Wang, 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":"{\"title\":\"Category-guided multi-interest collaborative metric learning with representation uniformity constraints\",\"authors\":\"Long Wang, 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}","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}
Category-guided multi-interest collaborative metric learning with representation uniformity constraints
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.
期刊介绍:
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.