Finding missing edges in networks based on their community structure
arXiv:1109.2793 · doi:10.1103/PhysRevE.85.056112
Abstract
Many edge prediction methods have been proposed, based on various local or global properties of the structure of an incomplete network. Community structure is another significant feature of networks: Vertices in a community are more densely connected than average. It is often true that vertices in the same community have "similar" properties, which suggests that missing edges are more likely to be found within communities than elsewhere. We use this insight to propose a strategy for edge prediction that combines existing edge prediction methods with community detection. We show that this method gives better prediction accuracy than existing edge prediction methods alone.
7 pages, 6 figures
References in corpus (9)
- Finding community structure in networks using the eigenvectors of matrices
- Maps of random walks on complex networks reveal community structure
- Benchmark graphs for testing community detection algorithms
- Link Prediction in Complex Networks: A Survey
- Hierarchical structure and the prediction of missing links in networks
- Predicting Missing Links via Local Information
- Finding statistically significant communities in networks
- Missing and spurious interactions and the reconstruction of complex networks
- Finding missing edges and communities in incomplete networks
Cited by in corpus (13)
- Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review
- Link Prediction with Node Clustering Coefficient
- Information filtering via hybridization of similarity preferential diffusion processes
- Detecting community structure in networks using edge prediction methods
- A novel metric for community detection
- Local degree blocking model for link prediction in complex networks
- Collaborative Filtering Approach to Link Prediction
- Robustness of community structure to node removal
- Structural Inference of Networked Dynamical Systems with Universal Differential Equations
- Automatic exploration of structural regularities in networks
- Membership in social networks and the application in information filtering
- Maximum Likelihood Estimation of Sparse Networks with Missing Observations
- Data reliability in complex directed networks