Identifying Hubs in Undergraduate Course Networks Based on Scaled Co-Enrollments: Extended Version

• URL: http://arxiv.org/abs/2104.14500v1
• Date: Tue, 27 Apr 2021 16:26:29 GMT
• Title: Identifying Hubs in Undergraduate Course Networks Based on Scaled Co-Enrollments: Extended Version
• Authors: Gary M. Weiss, Nam Nguyen, Karla Dominguez and Daniel D. Leeds
• Abstract summary: This study uses undergraduate student enrollment data to form networks of courses where connections are based on student co-enrollments. The networks are analyzed to identify "hub" courses often taken with many other courses.
• Score: 2.0796330979420836
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Understanding course enrollment patterns is valuable to predict upcoming demands for future courses, and to provide student with realistic courses to pursue given their current backgrounds. This study uses undergraduate student enrollment data to form networks of courses where connections are based on student co-enrollments. The course networks generated in this paper are based on eight years of undergraduate course enrollment data from a large metropolitan university. The networks are analyzed to identify "hub" courses often taken with many other courses. Two notions of hubs are considered: one focused on raw popularity across all students, and one focused on proportional likelihoods of co-enrollment with other courses. A variety of network metrics are calculated to evaluate the course networks. Academic departments and high-level academic categories, such as Humanities vs STEM, are studied for their influence over course groupings. The identification of hub courses has practical applications, since it can help better predict the impact of changes in course offerings and in course popularity, and in the case of interdisciplinary hub courses, can be used to increase or decrease interest and enrollments in specific academic departments and areas.

Related papers

• Cross-course Process Mining of Student Clickstream Data -- Aggregation and Group Comparison [0.0]
  This paper introduces novel methods for analyzing student interaction data extracted from course management systems like Moodle. We present a method for standardizing section labels across courses, cross-course analysis to uncover broader usage patterns.
  arXiv  Detail & Related papers  (2024-09-04T11:28:02Z)
• Enhancing the Performance of Automated Grade Prediction in MOOC using Graph Representation Learning [3.4882560718166626]
  Massive Open Online Courses (MOOCs) have gained significant traction as a rapidly growing phenomenon in online learning. Current automated assessment approaches overlook the structural links between different entities involved in the downstream tasks. We construct a unique knowledge graph for a large MOOC dataset, which will be publicly available to the research community.
  arXiv  Detail & Related papers  (2023-10-18T19:27:39Z)
• Experiences with Research Processes in an Undergraduate Theory of Computing Course [0.30458514384586394]
  Theory of computing (ToC) courses are a staple in many undergraduate CS curricula. We emulated a common research environment within our ToC course by creating a mock conference assignment.
  arXiv  Detail & Related papers  (2023-10-03T11:37:06Z)
• The interdisciplinary quantum information classroom: Themes from a survey of quantum information science instructors [0.0]
  Interdisciplinary introduction to quantum information science (QIS) courses are proliferating at universities across the US. We report on the findings of a survey of instructors teaching introduction to QIS courses at institutions across the US.
  arXiv  Detail & Related papers  (2022-02-12T00:37:58Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• Interleaving Computational and Inferential Thinking: Data Science for Undergraduates at Berkeley [81.01051375191828]
  The undergraduate data science curriculum at the University of California, Berkeley is anchored in five new courses. These courses emphasize computational thinking, inferential thinking, and working on real-world problems. These courses have become some of the most popular on campus and have led to a surging interest in a new undergraduate major and minor program in data science.
  arXiv  Detail & Related papers  (2021-02-13T22:51:24Z)
• UniNet: Next Term Course Recommendation using Deep Learning [0.0]
  We propose a deep learning approach to represent how chronological order of course grades affects the probability of success. We have shown that it is possible to obtain a performance of 81.10% on AUC metric using only grade information. This is shown to be meaningful across different student GPA levels and course difficulties.
  arXiv  Detail & Related papers  (2020-09-20T00:07:45Z)
• Attentional Graph Convolutional Networks for Knowledge Concept Recommendation in MOOCs in a Heterogeneous View [72.98388321383989]
  Massive open online courses ( MOOCs) provide a large-scale and open-access learning opportunity for students to grasp the knowledge. To attract students' interest, the recommendation system is applied by MOOCs providers to recommend courses to students. We propose an end-to-end graph neural network-based approach calledAttentionalHeterogeneous Graph Convolutional Deep Knowledge Recommender(ACKRec) for knowledge concept recommendation in MOOCs.
  arXiv  Detail & Related papers  (2020-06-23T18:28:08Z)
• Neural networks adapting to datasets: learning network size and topology [77.34726150561087]
  We introduce a flexible setup allowing for a neural network to learn both its size and topology during the course of a gradient-based training. The resulting network has the structure of a graph tailored to the particular learning task and dataset.
  arXiv  Detail & Related papers  (2020-06-22T12:46:44Z)
• GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
  Graph representation learning has emerged as a powerful technique for addressing real-world problems. We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework. We conduct experiments on three graph learning tasks and ten graph datasets.
  arXiv  Detail & Related papers  (2020-06-17T16:18:35Z)
• Fine-Grain Few-Shot Vision via Domain Knowledge as Hyperspherical Priors [79.22051549519989]
  Prototypical networks have been shown to perform well at few-shot learning tasks in computer vision. We show how we can achieve few-shot fine-grain classification by maximally separating the classes while incorporating domain knowledge as informative priors.
  arXiv  Detail & Related papers  (2020-05-23T02:10:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.