An efficient algorithm for community mining with overlap in social networks

作者：

Highlights：

• We propose a new algorithm for detecting overlapping groups.

• It is composed of two main components: building the core of a community and expansion this core.

• We suggest and prove a theorem for stopping the expansion of a community.

• We tested our method in artificial and real networks.

摘要

•We propose a new algorithm for detecting overlapping groups.•It is composed of two main components: building the core of a community and expansion this core.•We suggest and prove a theorem for stopping the expansion of a community.•We tested our method in artificial and real networks.

论文关键词：Social networks,Communities,Overlap,Objective function,Fuzzy membership degree

论文评审过程：Available online 17 January 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.01.002