Lightweight Model for Session-Based Recommender Systems with Seasonality Information in the Fashion Domain

Nicola Della Volpe, Lorenzo Mainetti, Alessio Martignetti, Andrea Menta, Riccardo Pala, Giacomo Polvanesi, Francesco Sammarco, Fernando Benjamin Perez Maurera, Cesare Bernardis, Maurizio Ferrari Dacrema
{"title":"Lightweight Model for Session-Based Recommender Systems with Seasonality Information in the Fashion Domain","authors":"Nicola Della Volpe, Lorenzo Mainetti, Alessio Martignetti, Andrea Menta, Riccardo Pala, Giacomo Polvanesi, Francesco Sammarco, Fernando Benjamin Perez Maurera, Cesare Bernardis, Maurizio Ferrari Dacrema","doi":"10.1145/3556702.3556829","DOIUrl":null,"url":null,"abstract":"This paper presents the solution designed by the team “Boston Team Party” for the ACM RecSys Challenge 2022. The competition was organized by Dressipi and was framed under the session-based fashion recommendations domain. Particularly, the task was to predict the purchased item at the end of each anonymous session. Our proposed two-stage solution is effective, lightweight, and scalable. First, it leverages the expertise of several strong recommendation models to produce a pool of candidate items. Then, a Gradient-Boosting Decision Tree model aggregates these candidates alongside several hand-crafted features to produce the final ranking. Our model achieved a score of 0.18800 in the public leaderboard. To aid in the reproducibility of our findings, we open-source our materials.","PeriodicalId":141185,"journal":{"name":"Proceedings of the Recommender Systems Challenge 2022","volume":"40 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.3556829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents the solution designed by the team “Boston Team Party” for the ACM RecSys Challenge 2022. The competition was organized by Dressipi and was framed under the session-based fashion recommendations domain. Particularly, the task was to predict the purchased item at the end of each anonymous session. Our proposed two-stage solution is effective, lightweight, and scalable. First, it leverages the expertise of several strong recommendation models to produce a pool of candidate items. Then, a Gradient-Boosting Decision Tree model aggregates these candidates alongside several hand-crafted features to produce the final ranking. Our model achieved a score of 0.18800 in the public leaderboard. To aid in the reproducibility of our findings, we open-source our materials.
基于会话的时尚领域季节性信息推荐系统的轻量级模型
本文介绍了“Boston team Party”团队为ACM RecSys挑战赛2022设计的解决方案。该竞赛由Dressipi组织,并在基于会议的时尚推荐领域框架下进行。具体来说,任务是在每个匿名会话结束时预测购买的物品。我们提出的两阶段解决方案是有效的、轻量级的和可扩展的。首先,它利用几个强推荐模型的专业知识来生成候选项目池。然后,一个梯度提升决策树模型将这些候选者与几个手工制作的特征聚集在一起,以产生最终的排名。我们的模型在公共排行榜上获得了0.18800的分数。为了帮助我们的发现的可重复性,我们开放了我们的材料。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信