A three-stage algorithm on community detection in social networks

作者：

Highlights：

• The presented three-stage algorithm detects communities without knowing the number of them beforehand.

• The central nodes’ identification completely depends on the node degree and the distance of nodes in networks.

• The number of communities is determined by the size of central nodes’ set.

• The three-stage algorithm converges to global optimum because of the integrated local and global structure information in it.

摘要

•The presented three-stage algorithm detects communities without knowing the number of them beforehand.•The central nodes’ identification completely depends on the node degree and the distance of nodes in networks.•The number of communities is determined by the size of central nodes’ set.•The three-stage algorithm converges to global optimum because of the integrated local and global structure information in it.

论文关键词：Community detection,Three-stage algorithm,Central nodes identification,Label propagation,Communities combination

论文评审过程：Received 12 August 2018, Revised 17 March 2019, Accepted 27 June 2019, Available online 3 July 2019, Version of Record 18 November 2019.

论文官网地址：https://doi.org/10.1016/j.knosys.2019.06.030