Good Papers
International Journal of Cognitive Informatics and Natural Intelligence 2025Link prediction

Community Partitioning Based on Coupling Density With Asymmetric Similarity Between Vertexes

Meijia Chen, Fahong Yu, Dongping Zhu

Published May 2, 2025Paper ↗

66%
OverallHighly rated
?
OverallHighly ratedVote to see the score
Readers
–

Only vote on papers you've read. Sign in to vote.

AI panel4/20reviewers recommend it
lenient 3/5
medium 1/10
strict 0/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

Community partitioning has become an important approach for uncovering underlying patterns in complex network analysis. This paper proposes a coupling density model with asymmetric similarity between vertices, which considers weighted coupling relations between connected groups and vertex similarities to guide the generation of new partitions and to measure inter-community similarity. Directed similarity, as a promising quality criterion, captures the directional tendency from one vertex to another by incorporating local attributes such as degree, neighbors, co-neighbors, and their interrelations. Theoretical and empirical evaluations on both real-world and synthetic networks demonstrate that the proposed metric model outperforms traditional modularity and standard density measures. Furthermore, the model was effectively applied to analyze textile-related trade networks.