An overlapping community detection algorithm based on rough clustering of links

作者：

Highlights：

• A new algorithm for community detection in complex networks has been proposed.

• Experiments have been performed on ten benchmark networks from diverse domains.

• Comparative analysis has been performed with the relevant state-of-the-art methods.

• The proposed algorithm competes favorably with state-of-the-art methods.

摘要

•A new algorithm for community detection in complex networks has been proposed.•Experiments have been performed on ten benchmark networks from diverse domains.•Comparative analysis has been performed with the relevant state-of-the-art methods.•The proposed algorithm competes favorably with state-of-the-art methods.

论文关键词：Complex networks,Community structure,Overlapping communities,Rough sets,Clustering

论文评审过程：Received 13 October 2017, Revised 6 June 2019, Accepted 30 November 2019, Available online 4 December 2019, Version of Record 29 February 2020.

论文官网地址：https://doi.org/10.1016/j.datak.2019.101777