{"title":"相关性与校准:基于邻居的推荐系统的三重校准距离设计","authors":"Zhuang Chen, Haitao Zou, Hualong Yu, Shang Zheng, Shang Gao","doi":"10.1177/01655515231182069","DOIUrl":null,"url":null,"abstract":"Calibrated recommendations are devoted to revealing the various preferences of users with the appropriate proportions in the recommendation list. Most of the existing calibrated-oriented recommendations take an extra postprocessing step to rerank the initial outputs. However, applying this postprocessing strategy may decrease the recommendation relevance, since the origin accurate outputs have been scattered, and they usually ignore the calibration between pairwise users/items. Instead of reranking the recommendation outputs, this article is dedicated to modifying the criterion of neighbour users’ selection, where we look forward to strengthening the recommendation relevance by calibrating the neighbourhood. We propose the first-order, second-order and the third-order calibration distance based on the motivation that if a user has a similar genre distribution or genre rating schema towards the target user, then his or her suggestions will be more useful for rating prediction. We also provide an equivalent transformation for the original method to speed up the algorithm with solid theoretical proof. Experimental analysis on two publicly available data sets empirically shows that our approaches are better than some of the state-of-the-art methods in terms of recommendation relevance, calibration and efficiency.","PeriodicalId":54796,"journal":{"name":"Journal of Information Science","volume":" ","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relevance meets calibration: Triple calibration distance design for neighbour-based recommender systems\",\"authors\":\"Zhuang Chen, Haitao Zou, Hualong Yu, Shang Zheng, Shang Gao\",\"doi\":\"10.1177/01655515231182069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Calibrated recommendations are devoted to revealing the various preferences of users with the appropriate proportions in the recommendation list. Most of the existing calibrated-oriented recommendations take an extra postprocessing step to rerank the initial outputs. However, applying this postprocessing strategy may decrease the recommendation relevance, since the origin accurate outputs have been scattered, and they usually ignore the calibration between pairwise users/items. Instead of reranking the recommendation outputs, this article is dedicated to modifying the criterion of neighbour users’ selection, where we look forward to strengthening the recommendation relevance by calibrating the neighbourhood. We propose the first-order, second-order and the third-order calibration distance based on the motivation that if a user has a similar genre distribution or genre rating schema towards the target user, then his or her suggestions will be more useful for rating prediction. We also provide an equivalent transformation for the original method to speed up the algorithm with solid theoretical proof. Experimental analysis on two publicly available data sets empirically shows that our approaches are better than some of the state-of-the-art methods in terms of recommendation relevance, calibration and efficiency.\",\"PeriodicalId\":54796,\"journal\":{\"name\":\"Journal of Information Science\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1177/01655515231182069\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1177/01655515231182069","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Relevance meets calibration: Triple calibration distance design for neighbour-based recommender systems
Calibrated recommendations are devoted to revealing the various preferences of users with the appropriate proportions in the recommendation list. Most of the existing calibrated-oriented recommendations take an extra postprocessing step to rerank the initial outputs. However, applying this postprocessing strategy may decrease the recommendation relevance, since the origin accurate outputs have been scattered, and they usually ignore the calibration between pairwise users/items. Instead of reranking the recommendation outputs, this article is dedicated to modifying the criterion of neighbour users’ selection, where we look forward to strengthening the recommendation relevance by calibrating the neighbourhood. We propose the first-order, second-order and the third-order calibration distance based on the motivation that if a user has a similar genre distribution or genre rating schema towards the target user, then his or her suggestions will be more useful for rating prediction. We also provide an equivalent transformation for the original method to speed up the algorithm with solid theoretical proof. Experimental analysis on two publicly available data sets empirically shows that our approaches are better than some of the state-of-the-art methods in terms of recommendation relevance, calibration and efficiency.
期刊介绍:
The Journal of Information Science is a peer-reviewed international journal of high repute covering topics of interest to all those researching and working in the sciences of information and knowledge management. The Editors welcome material on any aspect of information science theory, policy, application or practice that will advance thinking in the field.