Information flow simulation community detection of weighted-directed campus friendship network in continuous time
Ren Chao, Yang Menghui

TL;DR
This paper introduces a novel continuous-time, weighted directed community detection algorithm for campus friendship networks, improving the accuracy of social behavior analysis among college students.
Contribution
It proposes a new method that reconstructs campus friendship networks into weighted directed graphs in continuous time, enhancing community detection accuracy.
Findings
Reconstructed networks better reveal real friendship relationships.
The proposed algorithm achieves superior community detection effects.
Communities show students' similarities in behavior and habits.
Abstract
Educational data mining has become an important research field in studying the social behavior of college students using massive data. However, traditional campus friendship network and their community detection algorithms, which lack time characteristics, have their limitations. This paper proposes a new approach to address these limitations by reconstructing the campus friendship network into weighted directed networks in continuous time, improving the effectiveness of traditional campus friendship network and the accuracy of community detection results. To achieve this, a new weighted directed community detection algorithm for campus friendship network in continuous time is proposed, and it is used to study the community detection of a university student. The results show that the weighted directed friendship network reconstructed in this paper can reveal the real friend…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMental Health Research Topics
