arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.7192cs.AIcs.DS
收藏

同行评价的PeerRank方法

The PeerRank Method for Peer Assessment

NICTA(澳大利亚国家信息与通信技术研究院);UNSW(新南威尔士大学)

Toby Walsh

摘要:

我们提出了PeerRank方法进行同行评估。这将根据评估座席的座席提出的等级为座席构建等级。由于代理的等级是其正确分级能力的度量,因此PeerRank方法通过分级代理的等级对等级进行加权。PeerRank方法还为代理提供了正确评分的激励。由于代理的等级取决于分级代理的等级,并且由于这些等级本身取决于其他代理的等级,因此我们通过类似于用于对网页进行排名的PageRank方法的固定点方程来定义PeerRank方法。我们确定了PeerRank方法的一些形式化性质(例如,它满足对称性、无伪性、无歧视性和对称性公理),讨论了一些例子,并与相关工作进行了比较,并在一些合成数据上评估了性能。我们的研究结果显示出相当大的承诺,减少了2个或更多的因素在许多情况下,在自然基线平均同侪成绩的等级预测的错误。

英文摘要:

We propose the PeerRank method for peer assessment. This constructs a grade for an agent based on the grades proposed by the agents evaluating the agent. Since the grade of an agent is a measure of their ability to grade correctly, the PeerRank method weights grades by the grades of the grading agent. The PeerRank method also provides an incentive for agents to grade correctly. As the grades of an agent depend on the grades of the grading agents, and as these grades themselves depend on the grades of other agents, we define the PeerRank method by a fixed point equation similar to the PageRank method for ranking web-pages. We identify some formal properties of the PeerRank method (for example, it satisfies axioms of unanimity, no dummy, no discrimination and symmetry), discuss some examples, compare with related work and evaluate the performance on some synthetic data. Our results show considerable promise, reducing the error in grade predictions by a factor of 2 or more in many cases over the natural baseline of averaging peer grades.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑