An Autonomous Divisive Algorithm for Community Detection Based on Weak Link and Link-Break Strategy

Divisive algorithms are widely used for community detection. A common strategy of divisive algorithms is to remove the external links which connect different communities so that communities get disconnected from each other. Divisive algorithms have been investigated for several decades but some chal...

Full description

Saved in:
Bibliographic Details
Published inMathematical problems in engineering Vol. 2018; no. 2018; pp. 1 - 12
Main Authors Shen, Yiran, Yang, Jing, Zhang, Jianpei, Ding, Xiaoyu
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2018
Hindawi
Hindawi Limited
Subjects
Algorithms
Clustering
Communities
Computer science
Efficiency
Engineering
Graphs
Links
Physics
Social networks
Statistical mechanics
Strategy
Online AccessGet full text

Cover

More Information
Summary:Divisive algorithms are widely used for community detection. A common strategy of divisive algorithms is to remove the external links which connect different communities so that communities get disconnected from each other. Divisive algorithms have been investigated for several decades but some challenges remain unsolved: (1) how to efficiently identify external links, (2) how to efficiently remove external links, and (3) how to end a divisive algorithm with no help of predefined parameters or community definitions. To overcome these challenges, we introduced a concept of the weak link and autonomous division. The implementation of the proposed divisive algorithm adopts a new link-break strategy similar to a tug-of-war contest, where communities act as contestants and weak links act as breakable ropes. Empirical evaluations on artificial and real-world networks show that the proposed algorithm achieves a better accuracy-efficiency trade-off than some of the latest divisive algorithms.
ISSN:1024-123X
1563-5147
DOI:10.1155/2018/2942054