Temporal Community Analysis Using Centrality Measures

This research explores temporal community detection to identify patterns in course grading and offerings at The University of Illinois from Spring 2010 to Spring 2020. Using a dataset that includes course grades, subject codes, instructors, and student enrolment, the study applies four community detection algorithms—Greedy Modularity, Louvain, Leiden, and Walktrap—to examine how courses group based on grading similarities over time. The data is pre-processed, split into time slices, and represented as graphs where nodes are courses and edges are weighted by cosine similarity of grading patterns. Key metrics such as modularity, community size, edge density, overlap, and persistence are used to evaluate algorithm performance. The results provide insights into the evolution of grading structures, course groupings, and instructional trends, offering a deeper understanding of the dynamics in educational data. This analysis contributes to improved decision-making in academic program development and resource allocation.

Authors

Institutions

Publication Details

Published
2024-11-20
DOI
https://doi.org/10.1109/icei64305.2024.10912264
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Temporal Community Analysis Using Centrality Measures

Balaji Chandrasekaran, Pranav Jaysankar, Deepak Rajeshkumar, M.R Sree Padma Yookeesh et al.
Complex Network Analysis Techniques
article

Temporal Community Analysis Using Centrality Measures

Balaji Chandrasekaran, Pranav Jaysankar, Deepak Rajeshkumar, M.R Sree Padma Yookeesh, Smrithy Girijakumari
article en

Abstract

This research explores temporal community detection to identify patterns in course grading and offerings at The University of Illinois from Spring 2010 to Spring 2020. Using a dataset that includes course grades, subject codes, instructors, and student enrolment, the study applies four community detection algorithms—Greedy Modularity, Louvain, Leiden, and Walktrap—to examine how courses group based on grading similarities over time. The data is pre-processed, split into time slices, and represented as graphs where nodes are courses and edges are weighted by cosine similarity of grading patterns. Key metrics such as modularity, community size, edge density, overlap, and persistence are used to evaluate algorithm performance. The results provide insights into the evolution of grading structures, course groupings, and instructional trends, offering a deeper understanding of the dynamics in educational data. This analysis contributes to improved decision-making in academic program development and resource allocation.

Anna University, Chennai (IN), Vellore Institute of Technology University (IN)
Openalex Percentile: Top 75%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Temporal Community Analysis Using Centrality Measures — Balaji Chandrasekaran, Pranav Jaysankar, et al. · (2024) | TGRS Research Map | TGRS