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

面向课程序列发现的等级聚合

Rank Aggregation for Course Sequence Discovery

University of California, Los Angeles(加利福尼亚大学洛杉矶分校);Westmont College(韦斯特蒙特学院)

Mihai Cucuringu, Charlie Marshak, Dillon Montag, Puck Rombach

摘要:

在这项工作中,我们适应的排名聚合框架,在大学水平的最佳课程序列的发现。每个学生都提供了他或她在本科生涯中所修课程的部分排名。我们根据学生通常参加课程的顺序计算课程之间的成对排名比较,汇总整个学生群体的结果,然后获得课程对之间的排名偏移的代理。我们提取一个全球排名的课程,通过几个国家的最先进的算法与成对的噪声信息,包括SerialRank,排名中心,和最近的SyncRank组同步问题的基础上的排名。我们测试这种应用程序的排名聚合15年的学生数据,从数学系在加州大学洛杉矶分校(UCLA)。此外,我们用上述方法对以最终GPA为条件的学生群体的不同子集进行实验,并突出显示了所获得的排名中的几个差异,这些差异揭示了数学课程中隐藏的预测试。

英文摘要:

In this work, we adapt the rank aggregation framework for the discovery of optimal course sequences at the university level. Each student provides a partial ranking of the courses taken throughout his or her undergraduate career. We compute pairwise rank comparisons between courses based on the order students typically take them, aggregate the results over the entire student population, and then obtain a proxy for the rank offset between pairs of courses. We extract a global ranking of the courses via several state-of-the art algorithms for ranking with pairwise noisy information, including SerialRank, Rank Centrality, and the recent SyncRank based on the group synchronization problem. We test this application of rank aggregation on 15 years of student data from the Department of Mathematics at the University of California, Los Angeles (UCLA). Furthermore, we experiment with the above approach on different subsets of the student population conditioned on final GPA, and highlight several differences in the obtained rankings that uncover hidden pre-requisites in the Mathematics curriculum.

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

↑