SCARS: A scalable context-aware recommendation system

Suman Datta, Joy deep Das, Prosenjit Gupta, S. Majumder
{"title":"SCARS: A scalable context-aware recommendation system","authors":"Suman Datta, Joy deep Das, Prosenjit Gupta, S. Majumder","doi":"10.1109/C3IT.2015.7060210","DOIUrl":null,"url":null,"abstract":"Recommender Systems (RS) are used to provide personalized suggestions for information, products and services that are not already used or experienced by a user, but are very likely to be preferred by him/her. Most of the existing RS employ variations of Collaborative Filtering (CF) for suggesting items relevant to users' interests. However, CF requires similarity computations that grows polynomially with the number of users and items in the database. In order to handle this scalability problem and speeding up the recommendation process, we propose a clustering based recommendation method. The proposed work utilizes the different user attributes such as age, gender, occupation, etc. as contextual features and then partitions the users' space on the basis of these attributes. We divide the entire users' space into smaller clusters based on the context, and then apply the recommendation algorithm separately to the clusters. This helps us to reduce the running time of the algorithm as we avoid computations over the entire data. In this work, we present a scalable CF framework that extends the traditional CF algorithms by incorporating users context into the recommendation process. While recommending to a target user in a specific cluster, our approach uses the ratings of the target user as well as the rating history of the other users in that cluster. One of the main objectives of our work is to reduce the running time without compromising the recommendation quality much. This ensures scalability, allowing us to tackle bigger datasets using the same resources. We have tested our algorithm on the MovieLens dataset, however, our recommendation approach is perfectly generalized. Experiments conducted indicate that our method is quite effective in reducing the running time.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C3IT.2015.7060210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Recommender Systems (RS) are used to provide personalized suggestions for information, products and services that are not already used or experienced by a user, but are very likely to be preferred by him/her. Most of the existing RS employ variations of Collaborative Filtering (CF) for suggesting items relevant to users' interests. However, CF requires similarity computations that grows polynomially with the number of users and items in the database. In order to handle this scalability problem and speeding up the recommendation process, we propose a clustering based recommendation method. The proposed work utilizes the different user attributes such as age, gender, occupation, etc. as contextual features and then partitions the users' space on the basis of these attributes. We divide the entire users' space into smaller clusters based on the context, and then apply the recommendation algorithm separately to the clusters. This helps us to reduce the running time of the algorithm as we avoid computations over the entire data. In this work, we present a scalable CF framework that extends the traditional CF algorithms by incorporating users context into the recommendation process. While recommending to a target user in a specific cluster, our approach uses the ratings of the target user as well as the rating history of the other users in that cluster. One of the main objectives of our work is to reduce the running time without compromising the recommendation quality much. This ensures scalability, allowing us to tackle bigger datasets using the same resources. We have tested our algorithm on the MovieLens dataset, however, our recommendation approach is perfectly generalized. Experiments conducted indicate that our method is quite effective in reducing the running time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
scar:一个可扩展的上下文感知推荐系统
推荐系统(RS)用于为用户尚未使用或体验过的信息、产品和服务提供个性化建议,但他/她很可能会选择这些信息、产品和服务。大多数现有的RS采用协同过滤(CF)的变体来建议与用户兴趣相关的项目。然而,CF需要的相似度计算随着数据库中用户和项目的数量呈多项式增长。为了解决这一可扩展性问题,加快推荐过程,我们提出了一种基于聚类的推荐方法。该作品利用不同的用户属性,如年龄、性别、职业等作为语境特征,然后根据这些属性对用户空间进行划分。我们基于上下文将整个用户空间划分为更小的聚类,然后分别对聚类应用推荐算法。这有助于我们减少算法的运行时间,因为我们避免了对整个数据的计算。在这项工作中,我们提出了一个可扩展的CF框架,通过将用户上下文纳入推荐过程来扩展传统的CF算法。在向特定集群中的目标用户推荐时,我们的方法使用目标用户的评分以及该集群中其他用户的评分历史。我们工作的主要目标之一是在不影响推荐质量的情况下减少运行时间。这确保了可扩展性,允许我们使用相同的资源处理更大的数据集。我们已经在MovieLens数据集上测试了我们的算法,但是,我们的推荐方法是完全一般化的。实验表明,该方法在缩短运行时间方面是非常有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of GaN buffer layer thickness on structural and optical properties of AlGaN/GaN based high electron mobility transistor structure grown on Si(111) substrate by plasma assisted molecular beam epitaxy technique Neural network based gene regulatory network reconstruction Facial landmark detection using FAST Corner Detector of UGC-DDMC Face Database of Tripura tribes A method for developing node probability table using qualitative value of software metrics Computational complexity analysis of PTS technique under graphics processing unit
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1