{"title":"Metric Learning For Context-Aware Recommender Systems","authors":"Firat Ismailoglu","doi":"10.1145/3480651.3480695","DOIUrl":null,"url":null,"abstract":"Context-Aware Recommender Systems (CARS) refer to recommender systems that can incorporate side information regarding to users, items and ratings. In the present study, we are concerned with CARS, where the side information is provided in the form of item-attribute matrix with entries indicating whether an item has an attribute. We propose to multiply this matrix with user-item rating matrix to represent the the users in the attribute space of the items. We then apply a popular metric learning method, specifically Mahalanobis Metric Learning (MMC), in the attribute space to calculate the distances between the users and their favorite items as less as possible. We recommend the n items that are closest to the users based on these calculations. We verify the effectiveness of the proposed method on two famous MovieLens datasets that differ in size showing that using metric learning increases the success of CARS up to 7% in comparison with using the traditional cosine similarity.","PeriodicalId":305943,"journal":{"name":"Proceedings of the 2021 International Conference on Pattern Recognition and Intelligent Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 International Conference on Pattern Recognition and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3480651.3480695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Context-Aware Recommender Systems (CARS) refer to recommender systems that can incorporate side information regarding to users, items and ratings. In the present study, we are concerned with CARS, where the side information is provided in the form of item-attribute matrix with entries indicating whether an item has an attribute. We propose to multiply this matrix with user-item rating matrix to represent the the users in the attribute space of the items. We then apply a popular metric learning method, specifically Mahalanobis Metric Learning (MMC), in the attribute space to calculate the distances between the users and their favorite items as less as possible. We recommend the n items that are closest to the users based on these calculations. We verify the effectiveness of the proposed method on two famous MovieLens datasets that differ in size showing that using metric learning increases the success of CARS up to 7% in comparison with using the traditional cosine similarity.