基于信用的推荐排序模型

Xiaolin Xu, Guanglin Xu
{"title":"基于信用的推荐排序模型","authors":"Xiaolin Xu, Guanglin Xu","doi":"10.1109/GrC.2012.6468700","DOIUrl":null,"url":null,"abstract":"In the application of Web 2.0, some websites usually give the list of something popular for their users. To reach this, they first collect ratings on something from a large number users, and then perform the calculation through some algorithms. The algorithms, however, don't take the credibility of user himself into consideration. The paper proposes a ranking model based on user's credit, which takes user's credit as his weight integrated into his rating, and thus information submitted by different users has different effectiveness. The steps to implement this is firstly to cluster users by K-means to find out senior users, then to evaluate something synthetically by Attribution Coordinate Synthetic Evaluation on condition that senior users' rating is weighted, and finally to get ranking list. The simulation for film recommendation validates the model for recommendation system.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A recommendation ranking model based on credit\",\"authors\":\"Xiaolin Xu, Guanglin Xu\",\"doi\":\"10.1109/GrC.2012.6468700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the application of Web 2.0, some websites usually give the list of something popular for their users. To reach this, they first collect ratings on something from a large number users, and then perform the calculation through some algorithms. The algorithms, however, don't take the credibility of user himself into consideration. The paper proposes a ranking model based on user's credit, which takes user's credit as his weight integrated into his rating, and thus information submitted by different users has different effectiveness. The steps to implement this is firstly to cluster users by K-means to find out senior users, then to evaluate something synthetically by Attribution Coordinate Synthetic Evaluation on condition that senior users' rating is weighted, and finally to get ranking list. The simulation for film recommendation validates the model for recommendation system.\",\"PeriodicalId\":126161,\"journal\":{\"name\":\"IEEE International Conference on Granular Computing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GrC.2012.6468700\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GrC.2012.6468700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在Web 2.0的应用程序中,一些网站通常会列出用户喜欢的东西。为了达到这个目标,他们首先从大量用户那里收集对某件事的评分,然后通过一些算法进行计算。然而,这些算法并没有考虑用户本人的可信度。本文提出了一种基于用户信用的排名模型,该模型以用户的信用作为权重,将其整合到用户的评分中,从而使得不同用户提交的信息具有不同的有效性。其实现步骤是先用K-means对用户进行聚类,找出高级用户,然后在对高级用户评分进行加权的情况下,用归因坐标综合评价法对某项进行综合评价,最后得到排名表。通过对电影推荐的仿真,验证了该模型用于推荐系统的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A recommendation ranking model based on credit
In the application of Web 2.0, some websites usually give the list of something popular for their users. To reach this, they first collect ratings on something from a large number users, and then perform the calculation through some algorithms. The algorithms, however, don't take the credibility of user himself into consideration. The paper proposes a ranking model based on user's credit, which takes user's credit as his weight integrated into his rating, and thus information submitted by different users has different effectiveness. The steps to implement this is firstly to cluster users by K-means to find out senior users, then to evaluate something synthetically by Attribution Coordinate Synthetic Evaluation on condition that senior users' rating is weighted, and finally to get ranking list. The simulation for film recommendation validates the model for recommendation system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An updated algorithm for fast computing positive region A new classification algorithm based on ensemble PSO_SVM and clustering analysis Rough set over dual-universes in general incomplete information system The research on computing dynamic reduct Qualitative mapping defined wavelet transformation
×
引用
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