Author
Listed:
- Yiran Chen
(School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, Shandong 264209, P. R. China)
- Qinma Kang
(School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, Shandong 264209, P. R. China)
- Wenqiang Duan
(School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, Shandong 264209, P. R. China)
- Yunfan Shan
(School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, Shandong 264209, P. R. China)
- Ran Xiao
(School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, Shandong 264209, P. R. China)
- Yunfan Kang
(Department of Computer Science and Engineering, University of California, Riverside, CA 92521, USA)
Abstract
Community detection in signed networks has become a research hotspot in the area of network science recently. Since the classical problem has great significance for theoretical analysis and practical application, many heuristics or metaheuristics have been presented. Despite some progress and results that have been achieved, it remains an open challenge to identify community structure in large signed networks. In this paper, we propose a simple and effective iterated local search algorithm coupled with a powerful local search mechanism to solve the community detection problem. Due to the limitation of modularity in resolution, the modularity density criterion is adopted to find communities in signed networks. Extensive experiments have been conducted on synthetic and real-world networks. The statistical analyses demonstrate that the proposed algorithm can provide high-quality solutions compared to the state-of-the-art algorithms.
Suggested Citation
Yiran Chen & Qinma Kang & Wenqiang Duan & Yunfan Shan & Ran Xiao & Yunfan Kang, 2022.
"An iterated local search algorithm for community detection in signed networks,"
International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 33(08), pages 1-21, August.
Handle:
RePEc:wsi:ijmpcx:v:33:y:2022:i:08:n:s0129183122501054
DOI: 10.1142/S0129183122501054
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:33:y:2022:i:08:n:s0129183122501054. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.