ANRF: An Adaptive Network Reconstruction Framework for Community Detection in Bipartite Networks

Bipartite network community detection is of significant importance for understanding the underlying structure and functional organization of real-world complex systems. Although many mature community detection algorithms exist for unipartite networks, they cannot be directly applied to bipartite networks due to their unique topological structure, characterized by heterogeneous node types and cross-layer connections. Furthermore, some existing bipartite network community detection methods still rely heavily on manual experience to set key parameters, which limits their applicability and scalability in practical scenarios. To address these issues, this paper proposes an enhanced framework—the Adaptive Network Reconstruction Framework (ANRF)—by introducing an adaptive parameter optimization mechanism based on the existing Network Reconstruction Framework (NRF). This framework can be effectively integrated with traditional unipartite network community detection algorithms to achieve automatic community detection with reduced dependence on manual parameter tuning. The core procedure of the method consists of four main steps. First, we calculate the interaction forces between node pairs. Second, through comprehensive analysis of the network topological features, we adaptively determine the threshold parameter θ and related parameters for the interaction forces. Third, based on these thresholds and parameters, we perform edge filtering on the bipartite network to construct a reconstructed network. Finally, we apply unipartite community detection algorithms directly to the reconstructed network to obtain the community structure. To validate the effectiveness of ANRF, we combined it with the Louvain method and the Greedy modularity method, and conducted experimental evaluations on multiple synthetic and real-world network datasets. A systematic comparison with current state-of-the-art algorithms was made. The experimental results on multiple synthetic and real-world datasets within our evaluated scope demonstrate that ANRF achieves competitive performance in terms of community modularity and community density compared to state-of-the-art algorithms, while significantly reducing reliance on manual parameter tuning and enhancing robustness under the tested conditions.