Finding missing edges and communities in incomplete networks
arXiv:1109.2215 · doi:10.1088/1751-8113/44/49/495102
Abstract
Many algorithms have been proposed for predicting missing edges in networks, but they do not usually take account of which edges are missing. We focus on networks which have missing edges of the form that is likely to occur in real networks, and compare algorithms that find these missing edges. We also investigate the effect of this kind of missing data on community detection algorithms.
15 pages, 9 figures
References in corpus (10)
- Fast unfolding of communities in large networks
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Link Prediction in Complex Networks: A Survey
- Hierarchical structure and the prediction of missing links in networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Predicting Missing Links via Local Information
- Missing and spurious interactions and the reconstruction of complex networks
- Effective and Efficient Similarity Index for Link Prediction of Complex Networks
- Information filtering based on transferring similarity