Understanding and using contextual information in recommender systems

Licai Wang
{"title":"Understanding and using contextual information in recommender systems","authors":"Licai Wang","doi":"10.1145/2009916.2010184","DOIUrl":null,"url":null,"abstract":"With the rapid development of information technology, the availability of huge amounts of online information makes retrieval a hard task for the average user. Recommender systems (RS) have been employed across several domains to ease this so-called “information overload” problem since the mid-1990s. Recently, context-aware recommender systems (CARS), aiming to further improve the performance accuracy and user satisfaction by fully utilizing contextual information (such as time, location, mood and company) into RS, has become one of the hottest topics [1]. Although a certain progress has been made, CARS still has to face to many challenges. This thesis investigates some key problems in CARS and then proposes some tested and untested approaches to mine the latent relationship among users, contextual information and items (such as movies, web pages and mobile services). In this thesis, the first task is how to elicit contextual user preferences implicitly. All of the existing CARS are based on the assumption that there are available explicit contextual user ratings (e.g., “Sam×Avatar×Morning×Home3”). However, it is hard to obtain sufficient contextual user preferences in practice. This thesis proposes a MAUT (multi attribute utility theory)-based approach to implicitly elicit contextual user preferences through analyzing contextual user behaviors. It considers every type of context as an attribute of items, elicit every unidimensional contextual user preferences based on a n ew context-based IF-IDF formula, and finally elicit multidimensional contextual user preferences after identifying different weights of different contexts. We design a personalized mobile services-oriented prototype system as a test bed to elicit contextual user preferences as well as generate contextual recommendations. I perform experimental comparison of this approach against the other baseline approaches, attaining significant improvements. Secondly, how to alleviate the sparsity problem in CARS is a key challenge. The data sparsity exists in any traditional RS. While incorporating contextual information, the problem of sparse in CARS becomes even more serious. I propose a HOSVD-based contextual recommendation approach, called TensorCARS [2]. It first constructs an N-order tensor to represent multidimensional contextual user preferences and decomposes it into (N-2) 3-order tensors according to different contexts, then uses the HOSVD technique to predict unknown unidimensional contextual user preferences, and then calculates every contextual influence coefficient that each context factor influences user preferences, and finally constructs a new N-order tensor using weighted linearization method. I perform experimental comparison using the prototype system, showing TensorCARS can help alleviate the sparsity problem and increase the prediction accuracy. Thirdly, I consider mood as an important context and design two mood-based hybrid collaborative filtering approaches. ACM CAMRa2010 [3] releases two datasets gathered by the Moviepilot and Filmtipset. I participate in the Moviepilot challenge track which addresses the contextual dimension related to a user’s mood. I first propose a new mood-based user-based collaborative filtering approach based on the assumption that users with similar moodpreference patterns may have similar user preferences to items, and then propose two new hybrid ones through fusing the former presented approach and the traditional user-based CF (i.e., a multiple-step KNN similarity fusion and a weighted predicted rating fusion strategy respectively). Both hybrid CF approaches outperform the other user-based CF ones in terms of all three evaluation metrics (i.e., MAP, P@N (N=5, 10) and AUC). Lastly, I focus on bring social network analysis into CARS in order to further improve recommendation accuracy. Intuitively, user needs are not only affected by his interests and environment, but also by many other factors such as social network relationship (due to the content and information contributed or distributed through the Social Web). Now I am designing a general model of social network-based context-aware recommender systems (SCRS) to search nearest neighbors in high dimensional spaces that contain both social networks and contextual user preferences data. I plan to perform experiments on the public Filmtipset dataset.","PeriodicalId":356580,"journal":{"name":"Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2009916.2010184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With the rapid development of information technology, the availability of huge amounts of online information makes retrieval a hard task for the average user. Recommender systems (RS) have been employed across several domains to ease this so-called “information overload” problem since the mid-1990s. Recently, context-aware recommender systems (CARS), aiming to further improve the performance accuracy and user satisfaction by fully utilizing contextual information (such as time, location, mood and company) into RS, has become one of the hottest topics [1]. Although a certain progress has been made, CARS still has to face to many challenges. This thesis investigates some key problems in CARS and then proposes some tested and untested approaches to mine the latent relationship among users, contextual information and items (such as movies, web pages and mobile services). In this thesis, the first task is how to elicit contextual user preferences implicitly. All of the existing CARS are based on the assumption that there are available explicit contextual user ratings (e.g., “Sam×Avatar×Morning×Home3”). However, it is hard to obtain sufficient contextual user preferences in practice. This thesis proposes a MAUT (multi attribute utility theory)-based approach to implicitly elicit contextual user preferences through analyzing contextual user behaviors. It considers every type of context as an attribute of items, elicit every unidimensional contextual user preferences based on a n ew context-based IF-IDF formula, and finally elicit multidimensional contextual user preferences after identifying different weights of different contexts. We design a personalized mobile services-oriented prototype system as a test bed to elicit contextual user preferences as well as generate contextual recommendations. I perform experimental comparison of this approach against the other baseline approaches, attaining significant improvements. Secondly, how to alleviate the sparsity problem in CARS is a key challenge. The data sparsity exists in any traditional RS. While incorporating contextual information, the problem of sparse in CARS becomes even more serious. I propose a HOSVD-based contextual recommendation approach, called TensorCARS [2]. It first constructs an N-order tensor to represent multidimensional contextual user preferences and decomposes it into (N-2) 3-order tensors according to different contexts, then uses the HOSVD technique to predict unknown unidimensional contextual user preferences, and then calculates every contextual influence coefficient that each context factor influences user preferences, and finally constructs a new N-order tensor using weighted linearization method. I perform experimental comparison using the prototype system, showing TensorCARS can help alleviate the sparsity problem and increase the prediction accuracy. Thirdly, I consider mood as an important context and design two mood-based hybrid collaborative filtering approaches. ACM CAMRa2010 [3] releases two datasets gathered by the Moviepilot and Filmtipset. I participate in the Moviepilot challenge track which addresses the contextual dimension related to a user’s mood. I first propose a new mood-based user-based collaborative filtering approach based on the assumption that users with similar moodpreference patterns may have similar user preferences to items, and then propose two new hybrid ones through fusing the former presented approach and the traditional user-based CF (i.e., a multiple-step KNN similarity fusion and a weighted predicted rating fusion strategy respectively). Both hybrid CF approaches outperform the other user-based CF ones in terms of all three evaluation metrics (i.e., MAP, P@N (N=5, 10) and AUC). Lastly, I focus on bring social network analysis into CARS in order to further improve recommendation accuracy. Intuitively, user needs are not only affected by his interests and environment, but also by many other factors such as social network relationship (due to the content and information contributed or distributed through the Social Web). Now I am designing a general model of social network-based context-aware recommender systems (SCRS) to search nearest neighbors in high dimensional spaces that contain both social networks and contextual user preferences data. I plan to perform experiments on the public Filmtipset dataset.
在推荐系统中理解和使用上下文信息
随着信息技术的飞速发展,海量的网络信息使得检索对普通用户来说是一项艰巨的任务。自20世纪90年代中期以来,推荐系统(RS)已经在多个领域得到应用,以缓解所谓的“信息过载”问题。最近,上下文感知推荐系统(CARS)成为[1]研究的热点之一,它旨在充分利用上下文信息(如时间、地点、心情和同伴)来进一步提高推荐的性能准确性和用户满意度。虽然取得了一定的进展,但CARS仍然面临着许多挑战。本文研究了CARS中的一些关键问题,然后提出了一些经过测试和未经测试的方法来挖掘用户、上下文信息和项目(如电影、网页和移动服务)之间的潜在关系。在本文中,第一个任务是如何隐含地引出上下文用户偏好。所有现有的car都是基于存在明确的上下文用户评级的假设(例如,“Sam×Avatar×Morning×Home≧3”)。然而,在实践中很难获得足够的上下文用户偏好。本文提出了一种基于多属性效用理论(MAUT)的方法,通过分析情境用户行为来隐含地引出情境用户偏好。它将每种类型的上下文视为物品的属性,基于新的基于上下文的IF-IDF公式推导出每种一维上下文用户偏好,最后在确定不同上下文的不同权重后推导出多维上下文用户偏好。我们设计了一个个性化的面向移动服务的原型系统作为测试平台,以引出上下文用户偏好并生成上下文推荐。我将这种方法与其他基线方法进行了实验比较,获得了显著的改进。其次,如何缓解car的稀疏性问题是一个关键的挑战。传统的遥感都存在数据稀疏性问题,在加入上下文信息的同时,CARS的稀疏性问题变得更加严重。我提出了一种基于hosvd的上下文推荐方法,称为TensorCARS[2]。首先构造一个n阶张量来表示多维语境用户偏好,并根据不同语境将其分解为(N-2)个3阶张量,然后利用HOSVD技术预测未知的一维语境用户偏好,然后计算每个语境因素影响用户偏好的每个语境影响系数,最后利用加权线性化方法构造一个新的n阶张量。我使用原型系统进行了实验比较,表明TensorCARS可以帮助缓解稀疏性问题,提高预测精度。第三,我将情绪作为一个重要的语境,设计了两种基于情绪的混合协同过滤方法。ACM CAMRa2010[3]发布了由Moviepilot和Filmtipset收集的两个数据集。我参加了Moviepilot挑战赛道,该赛道解决了与用户情绪相关的上下文维度。本文首先基于具有相似情绪偏好模式的用户可能对物品具有相似的用户偏好的假设,提出了一种新的基于情绪的基于用户的协同过滤方法,然后通过融合先前提出的方法和传统的基于用户的CF(即多步KNN相似性融合和加权预测评级融合策略)提出了两种新的混合方法。两种混合CF方法在所有三个评估指标(即MAP, P@N (N= 5,10)和AUC)方面都优于其他基于用户的CF方法。最后,我的重点是将社会网络分析引入CARS,以进一步提高推荐的准确性。从直观上看,用户需求不仅受到其兴趣和环境的影响,还受到许多其他因素的影响,如社交网络关系(由于通过社交网络贡献或分发的内容和信息)。现在我正在设计一个基于社交网络的上下文感知推荐系统(SCRS)的通用模型,用于在包含社交网络和上下文用户偏好数据的高维空间中搜索最近的邻居。我计划在公共Filmtipset数据集上进行实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信