Complex networks for benchmarking in global universities rankings.

Autor/inn/en	Tuesta, Esteban Fernández; Bolaños-Pizarro, Máxima; Neves, Daniel Pimentel; Fernández, Geziel; Axel-Berg, Justin
Titel	Complex networks for benchmarking in global universities rankings.
Quelle	In: Scientometrics, (2020) 1, S.405-425 PDF als Volltext Verfügbarkeit
Dokumenttyp	gedruckt; online; Zeitschriftenaufsatz
ISSN	0138-9130
DOI	10.1007/s11192-020-03637-9
Schlagwörter	Global universities rankings; Research evaluation; Benchmarking; ARWU; THE; QS
Abstract	Abstract Finding a set of units that can serve as a reference for growth or improvement in positions within a ranking is not a simple task, since each ranking method can place the same unit in different positions and may even differ in relative position within the ranking. This study proposes a method that applies a combination of network analysis and efficiency methods to global university rankings. Complex networks allow the creation of a graph structure that selects a set of units that change positions in consecutive rankings and also the selection of the set of nodes that are linked with a selected node. For this new set, it is possible to calculate the efficiency level using Data Envelopment Analysis (DEA), from which the benchmarks of the indicators for each of the selected universities can be computed. The purpose of this paper is to develop a methodology to find a set of universities that compete with any university selected from those in the global university rankings, in particular ARWU, THE and QS. Moreover, this work also proposes to estimate the efficiency level of each university that competes with the selected university using the Data Envelopment Analysis methodology in order to establish benchmarks for each of the target Universities. This methodology is replicable for any university in any ranking or set of rankings. Given the high volatility of rankings, this process can serve university policy makers in selecting indicators to focus on for improved results in the short term.
Erfasst von	OLC
Update	2023/2/05