Student similarity network clustering -- Does the time it takes for an answer to be selected follow a power-law?

December 23, 2023 Β· Entered Twilight Β· πŸ› arXiv.org

πŸ’€ TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: Article.pdf, Projeto Final - RedesComplexas CPS765.pdf, Projeto Final - RedesComplexas CPS765.pptx, ipynb_dataset(1), ipynb_dataset(2)

Authors Filipe S. P. Prates arXiv ID 2312.15277 Category physics.soc-ph Cross-listed cs.SI Citations 0 Venue arXiv.org Repository https://github.com/FilipePrates/CPS765-Complex_Networks-Projeto_final-Similaridade_entre_alunos Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago