Simple and Efficient Recommendation Strategy for Warm/Cold Sessions for RecSys Challenge 2022

Hyunsung Lee, Sungwook Yoo, Andrew Yang, Wonjun Jang, Chiwan Park
{"title":"Simple and Efficient Recommendation Strategy for Warm/Cold Sessions for RecSys Challenge 2022","authors":"Hyunsung Lee, Sungwook Yoo, Andrew Yang, Wonjun Jang, Chiwan Park","doi":"10.1145/3556702.3556851","DOIUrl":null,"url":null,"abstract":"In this paper, we describe our approach for the RecSys 2022 Challenge organized by Dressipi. The goal of the challenge is to predict which item is purchased next given sessions of users as well as metadata of items from fashion e-commerce service. One key characteristic of this problem is that most sessions only have few (lower than 3) previous views. Furthermore, a large number of sessions (about 19%) contain views and purchases of items that did not appear before. We propose the following approaches to overcome these problems. First, we introduce a simple, yet strong sequence-aware MLP that outperforms recently proposed sequential recommenders such as BERT4Rec and GRU4Rec in the given dataset. Secondly, we propose a similarity metric that captures not only item metadata but also item popularity. Lastly, we predict recommendations for different types of sessions with different serving models.","PeriodicalId":141185,"journal":{"name":"Proceedings of the Recommender Systems Challenge 2022","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Recommender Systems Challenge 2022","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3556702.3556851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we describe our approach for the RecSys 2022 Challenge organized by Dressipi. The goal of the challenge is to predict which item is purchased next given sessions of users as well as metadata of items from fashion e-commerce service. One key characteristic of this problem is that most sessions only have few (lower than 3) previous views. Furthermore, a large number of sessions (about 19%) contain views and purchases of items that did not appear before. We propose the following approaches to overcome these problems. First, we introduce a simple, yet strong sequence-aware MLP that outperforms recently proposed sequential recommenders such as BERT4Rec and GRU4Rec in the given dataset. Secondly, we propose a similarity metric that captures not only item metadata but also item popularity. Lastly, we predict recommendations for different types of sessions with different serving models.
2022年RecSys挑战赛中简单有效的冷暖会话推荐策略
在本文中,我们描述了我们为Dressipi组织的RecSys 2022挑战赛所采取的方法。挑战的目标是预测给定用户会话的下一个购买项目以及来自时尚电子商务服务的项目元数据。这个问题的一个关键特征是,大多数会话只有很少(少于3个)以前的视图。此外,大量会话(约19%)包含以前没有出现过的项目的视图和购买。我们提出以下方法来克服这些问题。首先,我们引入了一个简单但强大的序列感知MLP,它在给定数据集中优于最近提出的顺序推荐,如BERT4Rec和GRU4Rec。其次,我们提出了一个相似度度量,该度量不仅可以捕获项目元数据,还可以捕获项目受欢迎程度。最后,我们用不同的服务模型预测不同类型会话的推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信