检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王洁[1] 刘建国 WANG Jie;LIU Jianguo(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China;Institute of Accounting and Finance,Shanghai University of Finance and Economics,Shanghai 200433,China;Research Group of Computational and AI Communication at Institute for Global Communications and Integrated Media,Fudan University,Shanghai 200433,China)
机构地区:[1]上海理工大学管理学院,上海200093 [2]上海财经大学会计与财务研究院,上海200433 [3]复旦大学全球全媒体研究院,上海200433
出 处:《上海理工大学学报》2023年第1期8-16,共9页Journal of University of Shanghai For Science and Technology
基 金:国家自然科学基金资助项目(72171150,71771152,61773248,71901144)。
摘 要:在线评级系统由于水军和恶意打分者的存在而无法对物品给出客观评价,因此,建立一个基于打分行为的声誉度量模型对于在线评级系统的健康发展至关重要。现有的用户声誉度量方法仅依靠用户评分和商品质量之间的差异进行计算,忽略了用户的行为模式。将用户的评分偏差和行为模式相结合,提出了一种新的声誉度量方法,该方法不仅考虑了用户打分频率的极值,还考虑了用户打分总次数。在两个实证数据集上的实验结果表明,新方法对随机打分的识别准确率相较于经典算法最高可以提高17%,对于解决冷启动和鲁棒性问题具有更好的表现。Online rating systems fail to measure qualities of items due to attacks given by unfair raters,and it is crucial for the health of online rating systems to establish a reputation ranking system to identify unfair raters. The existing user reputation measurement methods only take into account the difference between the user’s rating information and the item qualities, regardless of users’ rating behavior patterns. Combining users’ rating bias and behavioral patterns, a new reputation ranking method BPR was proposed, and the model considered not only the extremes of user rating frequency,but also the total number of user ratings. The extensive experimental results for empirical datasets show that, comparing with the classical method, the accuracy of the BPR method for identifying random ratings by large-scale users could be improved by up to 17%, with better performance for cold start and robustness problems.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31