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的分数。为了帮助我们的发现的可重复性,我们开放了我们的材料。