Detecting community structure in networks using edge prediction methods
arXiv:1201.3466 · doi:10.1088/1742-5468/2012/09/P09008
Abstract
Community detection and edge prediction are both forms of link mining: they are concerned with discovering the relations between vertices in networks. Some of the vertex similarity measures used in edge prediction are closely related to the concept of community structure. We use this insight to propose a novel method for improving existing community detection algorithms by using a simple vertex similarity measure. We show that this new strategy can be more effective in detecting communities than the basic community detection algorithms.
arXiv comment5 pages, 2 figures
References in corpus (21)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Finding community structure in networks using the eigenvectors of matrices
- Maps of random walks on complex networks reveal community structure
- The structure of scientific collaboration networks
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Analysis of weighted networks
- Defining and identifying communities in networks
- Clustering and preferential attachment in growing networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Self-similar community structure in organisations
- Finding overlapping communities in networks by label propagation
- Finding missing edges in networks based on their community structure
- The Role of Weight on Community Structure of Networks
- Detecting Communities in Networks by Merging Cliques
- Mesoscopic analysis of networks: applications to exploratory analysis and data clustering