A Fast Overlapping Community Detection Algorithm with Self-Correcting Ability

Abstract EN

Due to the defects of all kinds of modularity, thispaper defines a weighted modularity based on the densityand 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 testconditions for overlapping nodes and present a fast overlappingcommunity detection algorithm with self-correctingability, which is decomposed into two processes.

Under thecontrol of overlapping properties, the complexity of thealgorithm tends to be approximate linear.

And we also givea new understanding on membership vector.

Moreover, weimprove the bridgeness function which evaluates the extentof overlapping nodes.

Finally, we conduct the experimentson three networks with well known community structuresand the results verify the feasibility and effectiveness of ouralgorithm.