MIMOSA: A unified multi-view multi-order contrastive learning framework for bundle recommendation

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xiangyu Li , Yao Mu , Yuying Lin
{"title":"MIMOSA: A unified multi-view multi-order contrastive learning framework for bundle recommendation","authors":"Xiangyu Li ,&nbsp;Yao Mu ,&nbsp;Yuying Lin","doi":"10.1016/j.ipm.2025.104446","DOIUrl":null,"url":null,"abstract":"<div><div>Bundle recommendation has emerged as a vital online service that provides users with personalized collections of items likely to attract them. While existing methods attempt to integrate multi-view information, they often struggle to effectively leverage associations between entities (i.e., users and bundles), particularly in distinguishing between associated and non-associated entities. To address this, our study proposes an innovative bundle recommendation approach termed multi-view multi-order contrastive learning (MIMOSA), which simultaneously models the underlying relationships across multiple views and between different entities. The approach introduces a unified graph-based contrastive learning framework that organizes both intra- and inter-entity associations using different orders of proximity within the user-bundle graph. Specifically, MIMOSA customizes tactics for positive sample discovery and contrastive loss calculation to capture the heterogeneous semantics of various entity associations. This enables the alignment of associated entity embeddings while effectively dispersing non-associated ones. Additionally, a center-matching strategy is designed to efficiently coordinate multi-view entity representations, thereby accelerating the contrastive learning process. Extensive experiments on two large-scale datasets, Youshu and NetEase, demonstrate MIMOSA’s superior performance over baseline methods. The results show that compared to the best baseline, our proposed approach achieves average improvements of 2.87% (R@20) and 3.02% (N@20) on Youshu, and 5.19% (R@20) and 4.07% (N@20) on NetEase.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 2","pages":"Article 104446"},"PeriodicalIF":6.9000,"publicationDate":"2025-10-22","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/S0306457325003875","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

Bundle recommendation has emerged as a vital online service that provides users with personalized collections of items likely to attract them. While existing methods attempt to integrate multi-view information, they often struggle to effectively leverage associations between entities (i.e., users and bundles), particularly in distinguishing between associated and non-associated entities. To address this, our study proposes an innovative bundle recommendation approach termed multi-view multi-order contrastive learning (MIMOSA), which simultaneously models the underlying relationships across multiple views and between different entities. The approach introduces a unified graph-based contrastive learning framework that organizes both intra- and inter-entity associations using different orders of proximity within the user-bundle graph. Specifically, MIMOSA customizes tactics for positive sample discovery and contrastive loss calculation to capture the heterogeneous semantics of various entity associations. This enables the alignment of associated entity embeddings while effectively dispersing non-associated ones. Additionally, a center-matching strategy is designed to efficiently coordinate multi-view entity representations, thereby accelerating the contrastive learning process. Extensive experiments on two large-scale datasets, Youshu and NetEase, demonstrate MIMOSA’s superior performance over baseline methods. The results show that compared to the best baseline, our proposed approach achieves average improvements of 2.87% (R@20) and 3.02% (N@20) on Youshu, and 5.19% (R@20) and 4.07% (N@20) on NetEase.
MIMOSA:一个统一的多视图多阶对比学习框架,用于bundle推荐
捆绑推荐已经成为一项重要的在线服务,为用户提供可能吸引他们的个性化商品集合。虽然现有的方法试图集成多视图信息,但它们常常难以有效地利用实体(即用户和捆绑包)之间的关联,特别是在区分关联实体和非关联实体方面。为了解决这个问题,我们的研究提出了一种创新的捆绑推荐方法,称为多视图多阶对比学习(MIMOSA),该方法同时对多个视图和不同实体之间的潜在关系进行建模。该方法引入了一个统一的基于图的对比学习框架,该框架使用用户束图中不同的接近顺序来组织实体内部和实体之间的关联。具体来说,MIMOSA定制了积极样本发现和对比损失计算的策略,以捕获各种实体关联的异构语义。这样可以对齐相关的实体嵌入,同时有效地分散不相关的实体嵌入。此外,设计了一种中心匹配策略,以有效地协调多视图实体表示,从而加快对比学习过程。在优书和网易两个大规模数据集上进行的大量实验表明,MIMOSA的性能优于基线方法。结果表明,与最佳基线相比,我们提出的方法在优书上实现了2.87% (R@20)和3.02% (N@20)的平均改进,在网易上实现了5.19% (R@20)和4.07% (N@20)的平均改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信