Enhancing cross-market recommendations by addressing negative transfer and leveraging item co-occurrences

IF 3 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Systems Pub Date : 2024-04-16 DOI:10.1016/j.is.2024.102388
Zheng Hu , Satoshi Nakagawa , Shi-Min Cai , Fuji Ren , Jiawen Deng
{"title":"Enhancing cross-market recommendations by addressing negative transfer and leveraging item co-occurrences","authors":"Zheng Hu ,&nbsp;Satoshi Nakagawa ,&nbsp;Shi-Min Cai ,&nbsp;Fuji Ren ,&nbsp;Jiawen Deng","doi":"10.1016/j.is.2024.102388","DOIUrl":null,"url":null,"abstract":"<div><p>Real-world multinational e-commerce companies, such as Amazon and eBay, serve in multiple countries and regions. Some markets are data-scarce, while others are data-rich. In recent years, cross-market recommendation (CMR) has been proposed to bolster data-scarce markets by leveraging auxiliary information from data-rich markets. Previous CMR algorithms have employed techniques such as sharing market-agnostic parameters or incorporating inter-market similarity to optimize the performance of CMR. However, the existing approaches have several limitations: (1) They do not fully utilize the valuable information on item co-occurrences obtained from data-rich markets (such as the consistent purchase of mice and keyboards). (2) They ignore the issue of negative transfer stemming from disparities across diverse markets. To address these limitations, we introduce a novel attention-based model that exploits users’ historical behaviors to mine general patterns from item co-occurrences and designs market-specific embeddings to mitigate negative transfer. Specifically, we propose an attention-based user interest mining module to harness the potential of common items as bridges for mining general knowledge from item co-occurrence patterns through rich data derived from global markets. In order to mitigate the adverse effects of negative transfer, we decouple the item representations into market-specific embeddings and market-agnostic embeddings. The market-specific embeddings effectively model the inherent biases associated with different markets, while the market-agnostic embeddings learn generic representations of the items. Extensive experiments conducted on seven real-world datasets illustrate our model’s effectiveness.<span><sup>1</sup></span> Our model outperforms the suboptimal model by an average of 4.82%, 6.82%, 3.87%, and 5.34% across four variants of two metrics. Extensive experiments and analysis demonstrate the effectiveness of our proposed model in mining general item co-occurrence patterns and avoiding negative transfer for data-sparse markets.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"124 ","pages":"Article 102388"},"PeriodicalIF":3.0000,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306437924000462","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Real-world multinational e-commerce companies, such as Amazon and eBay, serve in multiple countries and regions. Some markets are data-scarce, while others are data-rich. In recent years, cross-market recommendation (CMR) has been proposed to bolster data-scarce markets by leveraging auxiliary information from data-rich markets. Previous CMR algorithms have employed techniques such as sharing market-agnostic parameters or incorporating inter-market similarity to optimize the performance of CMR. However, the existing approaches have several limitations: (1) They do not fully utilize the valuable information on item co-occurrences obtained from data-rich markets (such as the consistent purchase of mice and keyboards). (2) They ignore the issue of negative transfer stemming from disparities across diverse markets. To address these limitations, we introduce a novel attention-based model that exploits users’ historical behaviors to mine general patterns from item co-occurrences and designs market-specific embeddings to mitigate negative transfer. Specifically, we propose an attention-based user interest mining module to harness the potential of common items as bridges for mining general knowledge from item co-occurrence patterns through rich data derived from global markets. In order to mitigate the adverse effects of negative transfer, we decouple the item representations into market-specific embeddings and market-agnostic embeddings. The market-specific embeddings effectively model the inherent biases associated with different markets, while the market-agnostic embeddings learn generic representations of the items. Extensive experiments conducted on seven real-world datasets illustrate our model’s effectiveness.1 Our model outperforms the suboptimal model by an average of 4.82%, 6.82%, 3.87%, and 5.34% across four variants of two metrics. Extensive experiments and analysis demonstrate the effectiveness of our proposed model in mining general item co-occurrence patterns and avoiding negative transfer for data-sparse markets.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过解决负面转移和利用项目共现,加强跨市场推荐
现实世界中的跨国电子商务公司,如亚马逊和 eBay,在多个国家和地区提供服务。一些市场数据稀缺,而另一些市场数据丰富。近年来,有人提出了跨市场推荐(CMR),通过利用数据丰富市场的辅助信息来支持数据稀缺市场。以往的跨市场推荐算法采用了共享市场无关参数或结合市场间相似性等技术来优化跨市场推荐的性能。然而,现有方法有几个局限性:(1) 它们没有充分利用从数据丰富的市场(如鼠标和键盘的一致购买)中获得的物品共现的宝贵信息。(2) 它们忽视了不同市场间差异所产生的负迁移问题。为了解决这些局限性,我们引入了一种新颖的基于注意力的模型,该模型利用用户的历史行为从项目共现中挖掘一般模式,并设计针对特定市场的嵌入来减轻负迁移。具体来说,我们提出了一个基于注意力的用户兴趣挖掘模块,利用共同项目作为桥梁的潜力,通过从全球市场获得的丰富数据,从项目共现模式中挖掘一般知识。为了减轻负迁移的不利影响,我们将项目表征解耦为特定市场嵌入和市场无关嵌入。针对特定市场的嵌入有效地模拟了与不同市场相关的固有偏差,而与市场无关的嵌入则学习了项目的通用表征。在七个真实世界数据集上进行的大量实验证明了我们模型的有效性1。在两个指标的四个变体中,我们的模型平均优于次优模型 4.82%、6.82%、3.87% 和 5.34%。广泛的实验和分析证明了我们提出的模型在挖掘一般项目共现模式和避免数据稀缺市场的负转移方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Systems
Information Systems 工程技术-计算机:信息系统
CiteScore
9.40
自引率
2.70%
发文量
112
审稿时长
53 days
期刊介绍: Information systems are the software and hardware systems that support data-intensive applications. The journal Information Systems publishes articles concerning the design and implementation of languages, data models, process models, algorithms, software and hardware for information systems. Subject areas include data management issues as presented in the principal international database conferences (e.g., ACM SIGMOD/PODS, VLDB, ICDE and ICDT/EDBT) as well as data-related issues from the fields of data mining/machine learning, information retrieval coordinated with structured data, internet and cloud data management, business process management, web semantics, visual and audio information systems, scientific computing, and data science. Implementation papers having to do with massively parallel data management, fault tolerance in practice, and special purpose hardware for data-intensive systems are also welcome. Manuscripts from application domains, such as urban informatics, social and natural science, and Internet of Things, are also welcome. All papers should highlight innovative solutions to data management problems such as new data models, performance enhancements, and show how those innovations contribute to the goals of the application.
期刊最新文献
STracker: A framework for identifying sentiment changes in customer feedbacks Two-level massive string dictionaries A generative and discriminative model for diversity-promoting recommendation Soundness unknotted: An efficient soundness checking algorithm for arbitrary cyclic process models by loosening loops The composition diagram of a complex process: Enhancing understanding of hierarchical business processes
×
引用
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