Covariate Connectivity Combined Clustering for Weighted Networks
By: Zeyu Hu , Wenrui Li , Jun Yan and more
Potential Business Impact:
Finds hidden groups in connected data.
Community detection is a central task in network analysis, with applications in social, biological, and technological systems. Traditional algorithms rely primarily on network topology, which can fail when community signals are partly encoded in node-specific attributes. Existing covariate-assisted methods often assume the number of clusters is known, involve computationally intensive inference, or are not designed for weighted networks. We propose $\text{C}^4$: Covariate Connectivity Combined Clustering, an adaptive spectral clustering algorithm that integrates network connectivity and node-level covariates into a unified similarity representation. $\text{C}^4$ balances the two sources of information through a data-driven tuning parameter, estimates the number of communities via an eigengap heuristic, and avoids reliance on costly sampling-based procedures. Simulation studies show that $\text{C}^4$ achieves higher accuracy and robustness than competing approaches across diverse scenarios. Application to an airport reachability network demonstrates the method's scalability, interpretability, and practical utility for real-world weighted networks.
Similar Papers
On the Optimization of Methods for Establishing Well-Connected Communities
Social and Information Networks
Finds important groups in huge online networks.
Reliable data clustering with Bayesian community detection
Machine Learning (Stat)
Finds hidden patterns in messy data better.
Spectral Clustering on Multilayer Networks with Covariates
Methodology
Finds hidden groups in connected information.