在协同过滤中结合信任来缓解数据稀疏性和冷启动问题

Vahid Faridani, M. V. Jahan, Mehrdad Jalali
{"title":"在协同过滤中结合信任来缓解数据稀疏性和冷启动问题","authors":"Vahid Faridani, M. V. Jahan, Mehrdad Jalali","doi":"10.1109/ICCKE.2014.6993351","DOIUrl":null,"url":null,"abstract":"Collaborative filtering (CF) is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it suffers from several inherent deficiencies such as data sparsity and cold start. To better show user preferences for the cold users additional information (e.g., trust) is often applied. We describe the stages based on which the ratings of an active user's trusted neighbors are incorporated to complement and represent the preferences of the active user. First, by discriminating between different users, we calculate the significance of each user to make recommendations. Then the trusted neighbors of the active user are identified and aggregated. Hence, a new rating profile can be formed to represent the preferences of the active user. In the next stage, similar users probed based on the new rating profile. Finally, recommendations are generated in the same way as the conventional CF with the difference that if a similar neighbor had not rated the target item, we will predict the value of the target item for this similar neighbor by using the ratings of her directly trusted neighbors and applying MoleTrust algorithm, so as to incorporate more similar users to generate prediction for this target item. Experimental results demonstrate that our method outperforms other counterparts both in terms of accuracy and coverage.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Combining trust in collaborative filtering to mitigate data sparsity and cold-start problems\",\"authors\":\"Vahid Faridani, M. V. Jahan, Mehrdad Jalali\",\"doi\":\"10.1109/ICCKE.2014.6993351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering (CF) is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it suffers from several inherent deficiencies such as data sparsity and cold start. To better show user preferences for the cold users additional information (e.g., trust) is often applied. We describe the stages based on which the ratings of an active user's trusted neighbors are incorporated to complement and represent the preferences of the active user. First, by discriminating between different users, we calculate the significance of each user to make recommendations. Then the trusted neighbors of the active user are identified and aggregated. Hence, a new rating profile can be formed to represent the preferences of the active user. In the next stage, similar users probed based on the new rating profile. Finally, recommendations are generated in the same way as the conventional CF with the difference that if a similar neighbor had not rated the target item, we will predict the value of the target item for this similar neighbor by using the ratings of her directly trusted neighbors and applying MoleTrust algorithm, so as to incorporate more similar users to generate prediction for this target item. Experimental results demonstrate that our method outperforms other counterparts both in terms of accuracy and coverage.\",\"PeriodicalId\":152540,\"journal\":{\"name\":\"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE.2014.6993351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2014.6993351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

协同过滤(CF)是构建推荐系统最流行的方法,已成功地应用于许多应用中。然而,它存在一些固有的缺陷,如数据稀疏性和冷启动。为了更好地显示冷用户的用户偏好,通常会应用额外的信息(例如信任)。我们描述了一个阶段,在这个阶段中,一个活跃用户的可信邻居的评级被合并,以补充和表示活跃用户的偏好。首先,通过对不同用户的区分,计算每个用户对推荐的重要性。然后对活动用户的可信邻居进行识别和聚合。因此,可以形成一个新的评级配置文件来表示活动用户的偏好。在接下来的阶段,相似的用户将根据新的评级文件进行搜索。最后,以与传统CF相同的方式生成推荐,不同之处是,如果相似的邻居没有对目标物品进行评分,我们将通过使用她直接信任的邻居的评分并应用MoleTrust算法来预测该相似邻居的目标物品值,从而纳入更多相似的用户来生成对该目标物品的预测。实验结果表明,我们的方法在准确率和覆盖率方面都优于其他同类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combining trust in collaborative filtering to mitigate data sparsity and cold-start problems
Collaborative filtering (CF) is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it suffers from several inherent deficiencies such as data sparsity and cold start. To better show user preferences for the cold users additional information (e.g., trust) is often applied. We describe the stages based on which the ratings of an active user's trusted neighbors are incorporated to complement and represent the preferences of the active user. First, by discriminating between different users, we calculate the significance of each user to make recommendations. Then the trusted neighbors of the active user are identified and aggregated. Hence, a new rating profile can be formed to represent the preferences of the active user. In the next stage, similar users probed based on the new rating profile. Finally, recommendations are generated in the same way as the conventional CF with the difference that if a similar neighbor had not rated the target item, we will predict the value of the target item for this similar neighbor by using the ratings of her directly trusted neighbors and applying MoleTrust algorithm, so as to incorporate more similar users to generate prediction for this target item. Experimental results demonstrate that our method outperforms other counterparts both in terms of accuracy and coverage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信