{"title":"一种新的可能性协同过滤方法","authors":"Manel Slokom, R. Ayachi","doi":"10.1109/CSCESM.2015.7331895","DOIUrl":null,"url":null,"abstract":"Collaborative filtering approaches exploit users preferences to provide items recommendations. These preferences describing the actual state of the item are generally certain. However, in real problems we can not ignore the importance of uncertainty. In this paper, we propose a purely possibilistic collaborative filtering approach that provides a recommendation list given uncertain preferences expressed by possibility distributions. Experimental results show that the proposed approach outperforms traditional collaborative filtering algorithm.","PeriodicalId":232149,"journal":{"name":"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Towards a new possibilistic collaborative filtering approach\",\"authors\":\"Manel Slokom, R. Ayachi\",\"doi\":\"10.1109/CSCESM.2015.7331895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering approaches exploit users preferences to provide items recommendations. These preferences describing the actual state of the item are generally certain. However, in real problems we can not ignore the importance of uncertainty. In this paper, we propose a purely possibilistic collaborative filtering approach that provides a recommendation list given uncertain preferences expressed by possibility distributions. Experimental results show that the proposed approach outperforms traditional collaborative filtering algorithm.\",\"PeriodicalId\":232149,\"journal\":{\"name\":\"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCESM.2015.7331895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Second International Conference on Computer Science, Computer Engineering, and Social Media (CSCESM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCESM.2015.7331895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards a new possibilistic collaborative filtering approach
Collaborative filtering approaches exploit users preferences to provide items recommendations. These preferences describing the actual state of the item are generally certain. However, in real problems we can not ignore the importance of uncertainty. In this paper, we propose a purely possibilistic collaborative filtering approach that provides a recommendation list given uncertain preferences expressed by possibility distributions. Experimental results show that the proposed approach outperforms traditional collaborative filtering algorithm.