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

算法和数据结构课程中的同行评分:机器学习算法不会在简单的基线上改进

Peer Grading in a Course on Algorithms and Data Structures: Machine Learning Algorithms do not Improve over Simple Baselines

University of Hamburg(汉堡大学);Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);University of Tübingen(图宾根大学)

Mehdi S. M. Sajjadi, Morteza Alamgir, Ulrike von Luxburg

摘要:

同伴评分是学生互相审查作业的过程,例如提交作业,最近已成为大规模开放式在线课程(MOOC)中使用的流行机制。我们被这个想法所吸引,在汉堡大学的算法和数据结构课程中使用了它。在整个学期中,学生们反复提交练习,然后由助教和同伴评分机制进行评估,产生大量的教师和同伴评分数据集。我们应用了不同的统计和机器学习方法来汇总同行评分,以便为提交的作品提供准确的最终评分(监督和非监督,基于数字得分和顺序排名的方法)。令人惊讶的是,他们中没有一个人比使用平均同龄人成绩作为最终成绩的基线有所提高。我们讨论了一些可能的解释,这些结果,并提出了一个彻底的分析生成的数据集。

英文摘要:

Peer grading is the process of students reviewing each others' work, such as homework submissions, and has lately become a popular mechanism used in massive open online courses (MOOCs). Intrigued by this idea, we used it in a course on algorithms and data structures at the University of Hamburg. Throughout the whole semester, students repeatedly handed in submissions to exercises, which were then evaluated both by teaching assistants and by a peer grading mechanism, yielding a large dataset of teacher and peer grades. We applied different statistical and machine learning methods to aggregate the peer grades in order to come up with accurate final grades for the submissions (supervised and unsupervised, methods based on numeric scores and ordinal rankings). Surprisingly, none of them improves over the baseline of using the mean peer grade as the final grade. We discuss a number of possible explanations for these results and present a thorough analysis of the generated dataset.

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

↑