An effective and efficient label initialization method based on similarity for community detection in networks
Jyothimon chandran, Madhuviswanatham Vankadara

TL;DR
This paper introduces a new label initialization method based on link similarity to improve the stability and effectiveness of the label propagation algorithm in community detection within networks.
Contribution
It proposes a novel similarity-based label initialization approach that enhances LPA's stability and performance in community detection tasks.
Findings
Improved stability of LPA in community detection
Effective performance on real and synthetic networks
Reduced randomness in community assignments
Abstract
Identifying clusters or community structures in networks has become an integral part of social network analysis. Though many methods were proposed, the label propagation algorithm (LPA) is a popular computationally efficient method with running time linear. However, the LPA provides different combination of communities on the same network due to the randomness in LPA. Many improvements have been proposed to tackle this stability problem by eliminating the randomness. This paper put forward an improvement to the standard LPA by proposing a label initialization method based on link similarity. The similarity is measured based on the connection strength between two nodes. The method is tested on real and synthetic measures to analyze the performance.
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
TopicsComplex Network Analysis Techniques · Network Security and Intrusion Detection · Advanced Computing and Algorithms
