| 在线用户声誉评价算法的鲁棒性分析 |
| |
| 引用本文： | 李圣楠,杨凯,刘晓露,刘建国,郭强. 在线用户声誉评价算法的鲁棒性分析[J]. 上海理工大学学报, 2016, 38(4): 362-366 |
| |
| 作者姓名： | 李圣楠 杨凯 刘晓露 刘建国 郭强 |
| |
| 作者单位： | 上海理工大学 复杂系统科学研究中心, 上海 200093;上海理工大学 复杂系统科学研究中心, 上海 200093;上海理工大学 复杂系统科学研究中心, 上海 200093;上海理工大学 复杂系统科学研究中心, 上海 200093;上海财经大学 科研实验中心, 上海 200433;上海理工大学 复杂系统科学研究中心, 上海 200093 |
| |
| 基金项目： | 国家自然科学基金资助项目（71271126，71374177，61361125）；教育部博士点基金资助项目（20120078110002）；上海市东方学者特聘教授，上海市曙光学者（14SG42） |
| |
| 摘 要： | 在线评分系统中的恶意或随机打分为准确评价在线用户声誉带来了极大的挑战.对3种基于迭代的经典在线用户声誉评价算法的鲁棒性进行了细致研究.实验先将不同数量用户打分随机化,再以均方根误差为指标衡量其余用户声誉值受影响程度.实验共在3个数据集中进行,在MovieLens和Netflix两个经典实证数据集上的实验结果表明:系统中1%~60%的用户进行随机打分时,基于关联分析的CR算法始终保持很好的鲁棒性;基于打分迭代的IARR算法的均方根误差略有增大,最大值达到0.22,但整体波动较小;而改进的基于打分迭代的IARR2算法的均方根误差最大值达到0.695,其鲁棒性的较大波动是因算法受高声誉用户的影响较大.在Douban数据集上的结果表明:在打分数据稀疏情况下,CR算法也能保持很好的鲁棒性.
|
| 关 键 词： | 在线打分系统 用户声誉 鲁棒性 |
| 收稿时间： | 2015-08-22 |
Robustness Analysis of Online User Reputation Measurements |
| |
| LI Shengnan,YANG Kai,LIU Xiaolu,LIU Jianguo and GUO Qiang. Robustness Analysis of Online User Reputation Measurements[J]. Journal of University of Shanghai For Science and Technology, 2016, 38(4): 362-366 |
| |
| Authors: | LI Shengnan YANG Kai LIU Xiaolu LIU Jianguo GUO Qiang |
| |
| Affiliation: | Research Center for Complex Systems Science, University for Shanghai for Science and Technology, Shanghai 200093, China;Research Center for Complex Systems Science, University for Shanghai for Science and Technology, Shanghai 200093, China;Research Center for Complex Systems Science, University for Shanghai for Science and Technology, Shanghai 200093, China;Research Center for Complex Systems Science, University for Shanghai for Science and Technology, Shanghai 200093, China;Laboratory Centre, Shanghai University of Finance and Economics, Shanghai 200433, China;Research Center for Complex Systems Science, University for Shanghai for Science and Technology, Shanghai 200093, China |
| |
| Abstract: | Malicious and spam actions in online rating systems affect the user reputation measurements greatly.By setting different number of spammers and evaluating its effect by the root-mean-square error (RMSE),the robustness of three typical iterative-oriented online user reputation measurements was investigated.The results for MovieLens and Netflix data sets show that when facing with 1%~60% of spammers in the network,the CR algorithm has the best performance of robustness.The largest RMSE value of the iterative algorithm of reputation IARR reaches 0.22,with slight fluctuation of the RMSE.And the RMSE value of the improved iterative algorithm of reputation IARR2 reaches 0.695.The result for Douban data set shows that the CR algorithm still maintains great robustness even when the users rate few common items. |
| |
| Keywords: | online rating system user reputation robustness |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海理工大学学报》浏览原始摘要信息 |
|
点击此处可从《上海理工大学学报》下载全文 |
|
