Papers › Student similarity network clustering -- Does the time it takes for an answer to be...
Student similarity network clustering -- Does the time it takes for an answer to be selected follow a power-law?
Filipe S. P. Prates
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This article uses a dataset of answers to questions to generate student similarity networks. Two similarity functions to determine the weights between each pair of students are used, one that assumes a power-law distribution of answers response times, and one that does not. The resulting networks are then clustered using different community finding algorithms and their resulting modularity is compared.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections