Author:
Stavrinides Pavlos,Zuev Konstantin M.
Abstract
AbstractUnderstanding a complex system of relationships between courses is of great importance for the university’s educational mission. This paper is dedicated to the study of course-prerequisite networks (CPNs), where nodes represent courses and directed links represent the formal prerequisite relationships between them. The main goal of CPNs is to model interactions between courses, represent the flow of knowledge in academic curricula, and serve as a key tool for visualizing, analyzing, and optimizing complex curricula. First, we consider several classical centrality measures, discuss their meaning in the context of CPNs, and use them for the identification of important courses. Next, we describe the hierarchical structure of a CPN using the topological stratification of the network. Finally, we perform the interdependence analysis, which allows to quantify the strength of knowledge flow between university divisions and helps to identify the most intradependent, influential, and interdisciplinary areas of study. We discuss how course-prerequisite networks can be used by students, faculty, and administrators for detecting important courses, improving existing and creating new courses, navigating complex curricula, allocating teaching resources, increasing interdisciplinary interactions between departments, revamping curricula, and enhancing the overall students’ learning experience. The proposed methodology can be used for the analysis of any CPN, and it is illustrated with a network of courses taught at the California Institute of Technology. The network data analyzed in this paper is publicly available in the GitHub repository.
Funder
The Information Science and Technology (IST) initiative at Caltech
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computer Networks and Communications,Multidisciplinary
Reference39 articles.
1. Akbaş MI, Basavaraj P, Georgiopoulos M, Garibay Ö, Garibay I (2015) Curriculum GPS: an adaptive curriculum generation and planning system
2. Aldrich PR (2015) The curriculum prerequisite network: modeling the curriculum as a complex system. Biochem Mol Biol Educ 43(3):168–180. https://doi.org/10.1002/bmb.20861
3. Alvarez-Hamelin J, Dall’Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Weiss Y, Schölkopf B, Platt J (eds) Advances in neural information processing systems, vol 18
4. Anthonisse JM (1971) The rush in a directed graph. Technical report BN 9/71. https://ir.cwi.nl/pub/9791
5. Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512. https://doi.org/10.1126/science.286.5439.509
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献