A Fast Overlapping Community Detection Algorithm with Self-Correcting Ability
Due to the defects of all kinds of modularity, this paper defines a weighted modularity based on the density and cohesion as the new evaluation measurement. Since the proportion of the overlapping nodes in network is very low, the number of the nodes’ repeat visits can be reduced by signing the vert...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/738206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Due to the defects of all kinds of modularity, this
paper defines a weighted modularity based on the density
and cohesion as the new evaluation measurement. Since the proportion of the overlapping nodes in network is very low, the number of the nodes’ repeat visits can be reduced by signing the vertices with the overlapping attributes. In this paper, we propose three test
conditions for overlapping nodes and present a fast overlapping
community detection algorithm with self-correcting
ability, which is decomposed into two processes. Under the
control of overlapping properties, the complexity of the
algorithm tends to be approximate linear. And we also give
a new understanding on membership vector. Moreover, we
improve the bridgeness function which evaluates the extent
of overlapping nodes. Finally, we conduct the experiments
on three networks with well known community structures
and the results verify the feasibility and effectiveness of our
algorithm. |
|---|---|
| ISSN: | 2356-6140 1537-744X |