结合概率模型和LSTM的基于会话的推荐

C. Panagiotakis, H. Papadakis
{"title":"结合概率模型和LSTM的基于会话的推荐","authors":"C. Panagiotakis, H. Papadakis","doi":"10.1145/3556702.3556846","DOIUrl":null,"url":null,"abstract":"In this paper, we present the approach, we used as team ”DataLab HMU.GR”, for the ACM RecSys Challenge 2022 [1]. The challenge aims to predict the item that was purchased for a given sequence of item views (session). The full dataset, provided by Dressipi, consists of 1.1 million online retail sessions. Our proposed method, that solves the Session-Based Recommendation problem, relies on an efficient deterministic system based on a weighted combination of Probabilistic models and an LSTM neural network. Probabilistic models learn the transition probabilities between item-item interactions of each session, that are used to predict the purchase probability of an item in a new session. The LSTM neural network takes as input the context representation of the items in a session and a candidate item and predicts the purchase probability of the candidate item. The experimental results demonstrate the high performance and the computational efficiency of the probabilistic models. Our submission achieved the 13th rank and an overall score of 0.1963 in the final competition results. We release our source code at: https://github.com/cpanag79/recsys-Challenge-2022.","PeriodicalId":141185,"journal":{"name":"Proceedings of the Recommender Systems Challenge 2022","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Session-Based Recommendation by combining Probabilistic Models and LSTM\",\"authors\":\"C. Panagiotakis, H. Papadakis\",\"doi\":\"10.1145/3556702.3556846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present the approach, we used as team ”DataLab HMU.GR”, for the ACM RecSys Challenge 2022 [1]. The challenge aims to predict the item that was purchased for a given sequence of item views (session). The full dataset, provided by Dressipi, consists of 1.1 million online retail sessions. Our proposed method, that solves the Session-Based Recommendation problem, relies on an efficient deterministic system based on a weighted combination of Probabilistic models and an LSTM neural network. Probabilistic models learn the transition probabilities between item-item interactions of each session, that are used to predict the purchase probability of an item in a new session. The LSTM neural network takes as input the context representation of the items in a session and a candidate item and predicts the purchase probability of the candidate item. The experimental results demonstrate the high performance and the computational efficiency of the probabilistic models. Our submission achieved the 13th rank and an overall score of 0.1963 in the final competition results. We release our source code at: https://github.com/cpanag79/recsys-Challenge-2022.\",\"PeriodicalId\":141185,\"journal\":{\"name\":\"Proceedings of the Recommender Systems Challenge 2022\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Recommender Systems Challenge 2022\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3556702.3556846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Recommender Systems Challenge 2022","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3556702.3556846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们提出了一种方法,我们作为团队“DataLab HMU”使用。GR”,用于ACM RecSys Challenge 2022[1]。挑战的目的是预测在给定的项目视图序列(会话)中购买的项目。Dressipi提供的完整数据集包括110万个在线零售会话。我们提出的基于会话的推荐方法依赖于基于概率模型和LSTM神经网络加权组合的高效确定性系统。概率模型学习每个会话的物品-物品交互之间的转换概率,用于预测新会话中物品的购买概率。LSTM神经网络以会话中物品的上下文表示和候选物品作为输入,预测候选物品的购买概率。实验结果表明,该概率模型具有较高的性能和计算效率。在最后的比赛结果中,我们的作品获得了第13名,总分为0.1963。我们的源代码发布在:https://github.com/cpanag79/recsys-Challenge-2022。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Session-Based Recommendation by combining Probabilistic Models and LSTM
In this paper, we present the approach, we used as team ”DataLab HMU.GR”, for the ACM RecSys Challenge 2022 [1]. The challenge aims to predict the item that was purchased for a given sequence of item views (session). The full dataset, provided by Dressipi, consists of 1.1 million online retail sessions. Our proposed method, that solves the Session-Based Recommendation problem, relies on an efficient deterministic system based on a weighted combination of Probabilistic models and an LSTM neural network. Probabilistic models learn the transition probabilities between item-item interactions of each session, that are used to predict the purchase probability of an item in a new session. The LSTM neural network takes as input the context representation of the items in a session and a candidate item and predicts the purchase probability of the candidate item. The experimental results demonstrate the high performance and the computational efficiency of the probabilistic models. Our submission achieved the 13th rank and an overall score of 0.1963 in the final competition results. We release our source code at: https://github.com/cpanag79/recsys-Challenge-2022.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信