Research on Entropy-based Collaborative Filtering Algorithm

Chunhui Piao, J. Zhao, Jun Feng
{"title":"Research on Entropy-based Collaborative Filtering Algorithm","authors":"Chunhui Piao, J. Zhao, Jun Feng","doi":"10.1109/ICEBE.2007.75","DOIUrl":null,"url":null,"abstract":"Based on the brief introduction to the user-based and item-based collaborative filtering algorithms, the problems related to the two algorithms are analyzed, and a new entropy-based recommendation algorithm is proposed. Aimed at the drawbacks of traditional similarity measurement methods, we put forward an improved similarity measurement method. The entropy-based collaborative filtering algorithm contributes to solving the cold-start problem and discovering users' hidden interests. Using the practical data obtained from Movielens Website and MAE metrics for accuracy measure, three different collaborative filtering recommendation algorithms are compared through experiments. The results show that the entropy-based algorithm provides better recommendation quality than user-based algorithm and achieves recommendation accuracy comparable to the item-based algorithm. The experimental solution, the advantages of the entropy-based algorithm and future work are discussed in detail.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Business Engineering (ICEBE'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2007.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Based on the brief introduction to the user-based and item-based collaborative filtering algorithms, the problems related to the two algorithms are analyzed, and a new entropy-based recommendation algorithm is proposed. Aimed at the drawbacks of traditional similarity measurement methods, we put forward an improved similarity measurement method. The entropy-based collaborative filtering algorithm contributes to solving the cold-start problem and discovering users' hidden interests. Using the practical data obtained from Movielens Website and MAE metrics for accuracy measure, three different collaborative filtering recommendation algorithms are compared through experiments. The results show that the entropy-based algorithm provides better recommendation quality than user-based algorithm and achieves recommendation accuracy comparable to the item-based algorithm. The experimental solution, the advantages of the entropy-based algorithm and future work are discussed in detail.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于熵的协同过滤算法研究
在简要介绍基于用户和基于项目的协同过滤算法的基础上,分析了这两种算法存在的问题,提出了一种新的基于熵的协同推荐算法。针对传统相似度度量方法的不足,提出了一种改进的相似度度量方法。基于熵的协同过滤算法有助于解决冷启动问题和发现用户隐藏的兴趣。以Movielens网站的实际数据为基础,以MAE作为精度度量,通过实验比较了三种不同的协同过滤推荐算法。结果表明,基于熵的推荐算法比基于用户的推荐算法提供了更好的推荐质量,推荐精度与基于项目的推荐算法相当。详细讨论了实验解决方案、基于熵的算法的优点和未来的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Concern Oriented Business Process Modeling Analysis of RFID Adoption in China Problems and Prospects of Multi Application Smart cards in the UK Financial Industry The Proposal of Conditions of Personal Engagement in Knowledge Harvesting Adaptive Algorithmic Schemes for E-Service Strategic Management Methodologies: Case Studies on Knowledge Management
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1