arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.09006cs.DLcs.CY
收藏

大学排名有多可靠?

How Reliable are University Rankings?

Ali Dasdan, Eric Van Lare, Bosko Zivaljevic

摘要:

大学或学院排名几乎已经成为自己的一个行业,由美国新闻与世界报道(USNWR)和类似的组织发布。大多数排名使用类似的方案:以分数降序排列大学,其中每个分数是使用一组属性及其权重计算的;属性可以是客观的或主观的,而权重总是主观的。该方案是一般性的,足以适用于排名对象以外的大学。如相关工作所示,这些排名具有重要的意义,也有许多问题。在本文中,我们重新审视这个排名方案使用的公共大学数据集,我们正式和实验表明,在多种方式,这种排名方案是不可靠的,不能被信任为权威的,因为它是太敏感的重量变化,可以很容易地被玩弄。例如,我们展示了如何通过编程获得合理的权重,将数据集中的多所大学移动到最高排名;此外,在个人笔记本电脑上,这个任务需要几秒钟才能完成600多所大学。我们的数学公式,方法和结果也适用于排名对象以外的大学。我们的结论是,所有用于排名的数据和方法都应该开放,以供验证和重复。

英文摘要:

University or college rankings have almost become an industry of their own, published by US News \& World Report (USNWR) and similar organizations. Most of the rankings use a similar scheme: Rank universities in decreasing score order, where each score is computed using a set of attributes and their weights; the attributes can be objective or subjective while the weights are always subjective. This scheme is general enough to be applied to ranking objects other than universities. As shown in the related work, these rankings have important implications and also many issues. In this paper, we take a fresh look at this ranking scheme using the public College dataset; we both formally and experimentally show in multiple ways that this ranking scheme is not reliable and cannot be trusted as authoritative because it is too sensitive to weight changes and can easily be gamed. For example, we show how to derive reasonable weights programmatically to move multiple universities in our dataset to the top rank; moreover, this task takes a few seconds for over 600 universities on a personal laptop. Our mathematical formulation, methods, and results are applicable to ranking objects other than universities too. We conclude by making the case that all the data and methods used for rankings should be made open for validation and repeatability.

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

↑