Journal of Software
Detect overlapping communities efficiently and effectively in various social networks has been more and more important. Aiming at the high complexity of expanding strategy and the defect of generating many homeless nodes, they propose a quick algorithm based on local optimization of a fitness function. The proposed algorithm firstly selects a node as seed randomly. With a local fitness function, the algorithm then will expand from inside to outside of the seed according to the breadth-first-search in graph. As different seeds will expand to different communities independently and these communities have same nodes, thus their method can detect overlapping nodes quickly and efficiently.