Back to Search
Start Over
Link community detection based on line graphs with a novel link similarity measure.
- Source :
- International Journal of Modern Physics B: Condensed Matter Physics; Statistical Physics; Applied Physics; 3/10/2016, Vol. 30 Issue 6, p-1, 18p, 3 Diagrams, 7 Charts, 6 Graphs
- Publication Year :
- 2016
-
Abstract
- Link community gradually unfolds its capacity in complex network research. In this paper, a novel link similarity measure on line graphs is proposed. This measure can be adapted to different types of networks with an adjustable parameter. We prove its value converges to a limit on line graphs with the relationship of the nonneighbor links taken into account. Based on this similarity measure, we propose a novel link community detection algorithm for link clustering on line graphs. The detection algorithm combines the novel link similarity measure with the classic Markov Cluster (MCL) Algorithm and determines the link community partitions by calculating an extended modularity measure. Extensive experiments on two types of complex networks demonstrate the effectiveness, reliability and rationality of our solution in contrast to the other two classical algorithms. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH theory
MARKOV processes
ALGORITHMS
NUMERICAL calculations
MATHEMATICAL proofs
Subjects
Details
- Language :
- English
- ISSN :
- 02179792
- Volume :
- 30
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- International Journal of Modern Physics B: Condensed Matter Physics; Statistical Physics; Applied Physics
- Publication Type :
- Academic Journal
- Accession number :
- 113638048
- Full Text :
- https://doi.org/10.1142/S0217979216500235