Two-Stage Approach to Item Recommendation from User Sessions

M. Volkovs
{"title":"Two-Stage Approach to Item Recommendation from User Sessions","authors":"M. Volkovs","doi":"10.1145/2813448.2813512","DOIUrl":null,"url":null,"abstract":"We present our solution to the 2015 RecSys Challenge [1]. This challenge was based on a large scale dataset of over 9.2 million user-item click sessions from an online e-commerce retailer. The goal was to use this data to predict which items (if any) were bought in the 2.3 million test sessions. Our solution to this problem was two-staged, we first predicted if a given session contained a buy event and then predicted which items were bought. Both stages were fully automated and used classifiers trained on large sets of extracted features. The prediction rules were further optimized to the target objective using a greedy procedure developed specifically for this problem. Our best submission, which was a blend of several different models, achieved a score of 60,265 and placed 4'th out of 567 teams. All approaches presented in this work are general and can be applied to any problem of this type.","PeriodicalId":324873,"journal":{"name":"Proceedings of the 2015 International ACM Recommender Systems Challenge","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 International ACM Recommender Systems Challenge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2813448.2813512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

We present our solution to the 2015 RecSys Challenge [1]. This challenge was based on a large scale dataset of over 9.2 million user-item click sessions from an online e-commerce retailer. The goal was to use this data to predict which items (if any) were bought in the 2.3 million test sessions. Our solution to this problem was two-staged, we first predicted if a given session contained a buy event and then predicted which items were bought. Both stages were fully automated and used classifiers trained on large sets of extracted features. The prediction rules were further optimized to the target objective using a greedy procedure developed specifically for this problem. Our best submission, which was a blend of several different models, achieved a score of 60,265 and placed 4'th out of 567 teams. All approaches presented in this work are general and can be applied to any problem of this type.
从用户会话中推荐项目的两阶段方法
我们提出了我们的解决方案,以2015年RecSys挑战[1]。这个挑战是基于一个来自在线电子商务零售商的超过920万用户项目点击会话的大型数据集。目标是使用这些数据来预测在230万个测试会话中购买了哪些物品(如果有的话)。我们对这个问题的解决方案分为两个阶段,我们首先预测给定会话是否包含购买事件,然后预测购买了哪些物品。这两个阶段都是完全自动化的,使用的分类器是在提取的大量特征上训练的。使用专门针对该问题开发的贪心程序进一步优化预测规则以达到目标目标。我们提交的最佳作品混合了几种不同的模型,获得了60,265分,在567支队伍中排名第4。在这项工作中提出的所有方法都是通用的,可以应用于这种类型的任何问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信