An Optimized Collaborative Filtering Approach with Item Hierarchy-Interestingness

Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song
{"title":"An Optimized Collaborative Filtering Approach with Item Hierarchy-Interestingness","authors":"Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song","doi":"10.1109/BCGIN.2011.168","DOIUrl":null,"url":null,"abstract":"Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.
一种具有项目层次-兴趣度的优化协同过滤方法
协同过滤算法是最成功的推荐技术之一,在推荐系统中得到了广泛的应用。然而,传统的协同过滤存在数据稀疏性问题。项目资源本身具有层次性,人们的兴趣集中在几个层次上。此外,评价是多元的,受用户兴趣和商品质量等因素的影响。该算法利用上述思想对传统算法进行了相应的修改。实验结果表明,该算法能够保证系统推荐案例的准确性,有效缓解数据稀疏性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信