Enhancing Community Detection in Networks: A Comparative Analysis of Local Metrics and Hierarchical Algorithms
원문 초록
The analysis and detection of communities in network structures are becoming increasingly relevant for understanding social behavior. One of the principal challenges in this field is the complexity of existing algorithms. The Girvan-Newman algorithm, which uses the betweenness metric as a measure of node similarity, is one of the most representative algorithms in this area. This study employs the same method to evaluate the relevance of using local similarity metrics for community detection. A series of local metrics were tested on a set of networks constructed using the Girvan-Newman basic algorithm. The efficacy of these metrics was evaluated by applying the base algorithm to several real networks with varying community sizes, using modularity and NMI. The results indicate that approaches based on local similarity metrics have significant potential for community detection.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach
Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
Community and hyperedge inference in multiple hypergraphs
Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation
Robust Markov stability for community detection at a scale learned based on the structure
토론
이 논문과 연결된 포럼 글이 아직 없습니다.