Collaborative Filtering Recommendation Algorithm Based on Users of Maximum Similar Clique

Zhaoyang Zhou, Y. He
{"title":"Collaborative Filtering Recommendation Algorithm Based on Users of Maximum Similar Clique","authors":"Zhaoyang Zhou, Y. He","doi":"10.1109/ISCC-C.2013.58","DOIUrl":null,"url":null,"abstract":"In order to improve the performance of Collaborative filtering (CF), a new method of producing the nearest neighbor for active user is proposed in this paper. Inspired by the conformist of E-commerce consumers, we build the user model of maximum similar clique and we use it to improve the method of producing the nearest neighbors for target users. A collaborative filtering recommendation algorithm MCQ-CF based on user model is present. The experiment results show that the algorithm MCQ-CF has good performance for accuracy and stability.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Science and Cloud Computing Companion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC-C.2013.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In order to improve the performance of Collaborative filtering (CF), a new method of producing the nearest neighbor for active user is proposed in this paper. Inspired by the conformist of E-commerce consumers, we build the user model of maximum similar clique and we use it to improve the method of producing the nearest neighbors for target users. A collaborative filtering recommendation algorithm MCQ-CF based on user model is present. The experiment results show that the algorithm MCQ-CF has good performance for accuracy and stability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最大相似团用户的协同过滤推荐算法
为了提高协同过滤(CF)的性能,本文提出了一种针对活跃用户产生最近邻的新方法。受电子商务消费者从众性的启发,建立了最大相似团的用户模型,并利用该模型改进了目标用户最近邻的生成方法。提出了一种基于用户模型的协同过滤推荐算法MCQ-CF。实验结果表明,该算法具有良好的精度和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Commercial Bank Stress Tests Based on Credit Risk An Instant-Based Qur'an Memorizer Application Interface Optimization of PID Parameters Based on Improved Particle-Swarm-Optimization The Universal Approximation Capabilities of 2pi-Periodic Approximate Identity Neural Networks Survey of Cloud Messaging Push Notification Service
×
引用
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