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}
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).