IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i2p265-d1567562.html
   My bibliography  Save this article

A Consensus Community-Based Spider Wasp Optimization for Dynamic Community Detection

Author

Listed:
  • Lin Yu

    (School of Automation, Nanjing University of Science and Technology, Xiaolingwei Street, Nanjing 210094, China
    These authors contributed equally to this work.)

  • Xin Zhao

    (National Key Laboratory of Information Systems Engineering, Nanjing Research Institute of Electronic Engineering, Huitong Street, Nanjing 210007, China)

  • Ming Lv

    (School of Automation, Nanjing University of Science and Technology, Xiaolingwei Street, Nanjing 210094, China)

  • Jie Zhang

    (School of Automation, Nanjing University of Science and Technology, Xiaolingwei Street, Nanjing 210094, China
    These authors contributed equally to this work.)

Abstract

There are many evolving dynamic networks in the real world, and community detection in dynamic networks is crucial in many complex network analysis applications. In this paper, a consensus community-based discrete spider wasp optimization (SWO) approach is proposed for the dynamic network community detection problem. First, the coding, initialization, and updating strategies of the spider wasp optimization algorithm are discretized to adapt to the community detection problem. Second, the concept of intra-population and inter-population consensus community is proposed. Consensus community is the knowledge formed by the swarm summarizing the current state as well as the past history. By maintaining certain inter-population consensus community during the evolutionary process, the population in the current time window can evolve in a similar direction to those in the previous time step. Experimental results on many artificial and real dynamic networks show that the proposed method produces more accurate and robust results than current methods.

Suggested Citation

  • Lin Yu & Xin Zhao & Ming Lv & Jie Zhang, 2025. "A Consensus Community-Based Spider Wasp Optimization for Dynamic Community Detection," Mathematics, MDPI, vol. 13(2), pages 1-22, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:2:p:265-:d:1567562
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/2/265/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/2/265/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:2:p:265-:d:1567562. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.