一种基于Jaccard的相似度度量来提高基于CF的推荐系统的性能

Mubbashir Ayub, M. Ghazanfar, M. Maqsood, Asjad Saleem
{"title":"一种基于Jaccard的相似度度量来提高基于CF的推荐系统的性能","authors":"Mubbashir Ayub, M. Ghazanfar, M. Maqsood, Asjad Saleem","doi":"10.1109/ICOIN.2018.8343073","DOIUrl":null,"url":null,"abstract":"Revolution in social computing has resulted in the wonderful evolution of recommender systems. Recommender systems maintain a repository of user profiles, created by a community of users, for generating personalized recommendations aimed at individual users. One of the approaches used in recommender systems is collaborative filtering (CF) which has become one of the most famous approaches for providing personalized recommendations to users. Nearest neighbors based methods used in CF are being widely used by many online stores to enhance users shopping experience. Nearest neighbors-based CF methods use some similarity measure techniques to find similar users/items for an active user/item. Almost all similarity measurement methods use ratings of commonly rated items while calculating similarity between a pair of users/items. Our approach works in the same manner as Jaccard similarity works. But Jaccard similarity does not consider the absolute value of rating and only considers the ratio of co-rated items. We take into account the ratio of absolute rating values which are equal in value, to the total no of co-rated items. An additional argument we take into account is the average rating value of users. We compared performance of our proposed method with many state-of-the-art similarity measures. Recommendation results from a set of real data sets show that our proposed measure has some performance improvement in terms of Mean Absolute Error (MAE) and Root Mean Square Error (RMSE).","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"A Jaccard base similarity measure to improve performance of CF based recommender systems\",\"authors\":\"Mubbashir Ayub, M. Ghazanfar, M. Maqsood, Asjad Saleem\",\"doi\":\"10.1109/ICOIN.2018.8343073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Revolution in social computing has resulted in the wonderful evolution of recommender systems. Recommender systems maintain a repository of user profiles, created by a community of users, for generating personalized recommendations aimed at individual users. One of the approaches used in recommender systems is collaborative filtering (CF) which has become one of the most famous approaches for providing personalized recommendations to users. Nearest neighbors based methods used in CF are being widely used by many online stores to enhance users shopping experience. Nearest neighbors-based CF methods use some similarity measure techniques to find similar users/items for an active user/item. Almost all similarity measurement methods use ratings of commonly rated items while calculating similarity between a pair of users/items. Our approach works in the same manner as Jaccard similarity works. But Jaccard similarity does not consider the absolute value of rating and only considers the ratio of co-rated items. We take into account the ratio of absolute rating values which are equal in value, to the total no of co-rated items. An additional argument we take into account is the average rating value of users. We compared performance of our proposed method with many state-of-the-art similarity measures. Recommendation results from a set of real data sets show that our proposed measure has some performance improvement in terms of Mean Absolute Error (MAE) and Root Mean Square Error (RMSE).\",\"PeriodicalId\":228799,\"journal\":{\"name\":\"2018 International Conference on Information Networking (ICOIN)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2018.8343073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2018.8343073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

摘要

社会计算的革命导致了推荐系统的奇妙进化。推荐系统维护由用户社区创建的用户配置文件存储库,用于生成针对单个用户的个性化推荐。推荐系统中使用的一种方法是协同过滤(CF),它已成为向用户提供个性化推荐的最著名的方法之一。CF中使用的基于最近邻的方法被许多在线商店广泛使用,以增强用户的购物体验。基于最近邻的CF方法使用一些相似性度量技术为活动用户/项查找相似的用户/项。几乎所有的相似度测量方法在计算一对用户/物品之间的相似度时,都使用通常评级的物品的评级。我们的方法的工作方式与Jaccard相似性的工作方式相同。但Jaccard相似性不考虑评价的绝对值,只考虑共同评价项目的比例。我们考虑了绝对评级值的比率,这些评级值在价值上是相等的,与共同评级项目的总数相比。我们要考虑的另一个参数是用户的平均评价值。我们将我们提出的方法的性能与许多最先进的相似性度量进行了比较。一组真实数据集的推荐结果表明,我们提出的方法在平均绝对误差(MAE)和均方根误差(RMSE)方面有一定的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Jaccard base similarity measure to improve performance of CF based recommender systems
Revolution in social computing has resulted in the wonderful evolution of recommender systems. Recommender systems maintain a repository of user profiles, created by a community of users, for generating personalized recommendations aimed at individual users. One of the approaches used in recommender systems is collaborative filtering (CF) which has become one of the most famous approaches for providing personalized recommendations to users. Nearest neighbors based methods used in CF are being widely used by many online stores to enhance users shopping experience. Nearest neighbors-based CF methods use some similarity measure techniques to find similar users/items for an active user/item. Almost all similarity measurement methods use ratings of commonly rated items while calculating similarity between a pair of users/items. Our approach works in the same manner as Jaccard similarity works. But Jaccard similarity does not consider the absolute value of rating and only considers the ratio of co-rated items. We take into account the ratio of absolute rating values which are equal in value, to the total no of co-rated items. An additional argument we take into account is the average rating value of users. We compared performance of our proposed method with many state-of-the-art similarity measures. Recommendation results from a set of real data sets show that our proposed measure has some performance improvement in terms of Mean Absolute Error (MAE) and Root Mean Square Error (RMSE).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信