Which app will you use next?: collaborative filtering with interactional context

Nagarajan Natarajan, D. Shin, I. Dhillon
{"title":"Which app will you use next?: collaborative filtering with interactional context","authors":"Nagarajan Natarajan, D. Shin, I. Dhillon","doi":"10.1145/2507157.2507186","DOIUrl":null,"url":null,"abstract":"The application a smart phone user will launch next intuitively depends on the sequence of apps used recently. More generally, when users interact with systems such as shopping websites or online radio, they click on items that are of interest in the current context. We call the sequence of clicks made in the current session interactional context. It is desirable for a recommender system to use the context set by the user to update recommendations. Most current context-aware recommender systems focus on a relatively less dynamic representational context defined by attributes such as season, location and tastes. In this paper, we study the problem of collaborative filtering with interactional context, where the goal is to make personalized and dynamic recommendations to a user engaged in a session. To this end, we propose the methodname algorithm that works in two stages. First, users are clustered by their transition behavior (one-step Markov transition probabilities between items), and cluster-level Markov models are computed. Then personalized PageRank is computed for a given user on the corresponding cluster Markov graph, with a personalization vector derived from the current context. We give an interpretation of the second stage of the algorithm as adding an appropriate context bias, in addition to click bias (or rating bias), to a classical neighborhood-based collaborative filtering model, where the neighborhood is determined from a Markov graph. Experimental results on two real-life datasets demonstrate the superior performance of our algorithm, where we achieve at least 20% (up to 37%) improvement over competitive methods in the recall level at top-20.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"96","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th ACM conference on Recommender systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2507157.2507186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 96

Abstract

The application a smart phone user will launch next intuitively depends on the sequence of apps used recently. More generally, when users interact with systems such as shopping websites or online radio, they click on items that are of interest in the current context. We call the sequence of clicks made in the current session interactional context. It is desirable for a recommender system to use the context set by the user to update recommendations. Most current context-aware recommender systems focus on a relatively less dynamic representational context defined by attributes such as season, location and tastes. In this paper, we study the problem of collaborative filtering with interactional context, where the goal is to make personalized and dynamic recommendations to a user engaged in a session. To this end, we propose the methodname algorithm that works in two stages. First, users are clustered by their transition behavior (one-step Markov transition probabilities between items), and cluster-level Markov models are computed. Then personalized PageRank is computed for a given user on the corresponding cluster Markov graph, with a personalization vector derived from the current context. We give an interpretation of the second stage of the algorithm as adding an appropriate context bias, in addition to click bias (or rating bias), to a classical neighborhood-based collaborative filtering model, where the neighborhood is determined from a Markov graph. Experimental results on two real-life datasets demonstrate the superior performance of our algorithm, where we achieve at least 20% (up to 37%) improvement over competitive methods in the recall level at top-20.
接下来你会使用哪个应用程序?:具有交互上下文的协同过滤
智能手机用户接下来将启动的应用程序直观地取决于最近使用的应用程序的顺序。更一般地说,当用户与购物网站或在线广播等系统交互时,他们会点击当前上下文中感兴趣的项目。我们将当前会话中所进行的单击序列称为交互上下文。推荐系统希望使用用户设置的上下文来更新推荐。目前大多数上下文感知推荐系统关注的是由季节、地点和口味等属性定义的相对不那么动态的代表性上下文。在本文中,我们研究了具有交互上下文的协同过滤问题,其目标是向参与会话的用户提供个性化和动态的推荐。为此,我们提出了分两个阶段工作的methodname算法。首先,根据用户的转移行为(项目之间的一步马尔可夫转移概率)对用户进行聚类,并计算聚类级马尔可夫模型。然后使用从当前上下文导出的个性化向量,在相应的聚类马尔可夫图上计算给定用户的个性化PageRank。我们对算法的第二阶段进行了解释,除了点击偏差(或评级偏差)之外,还在经典的基于邻域的协同过滤模型中添加了适当的上下文偏差,其中邻域是从马尔可夫图中确定的。在两个真实数据集上的实验结果证明了我们的算法的卓越性能,在前20名的召回水平上,我们比竞争对手的方法提高了至少20%(最高37%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书