{"title":"MIMOSA: A unified multi-view multi-order contrastive learning framework for bundle recommendation","authors":"Xiangyu Li , Yao Mu , 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.
期刊介绍:
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.