IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v36y2025i06ns0129183124502371.html
   My bibliography  Save this article

A moth-flame algorithm based on social learning theory for influence maximization

Author

Listed:
  • Qiwen Zhang

    (School of Computer and Communication, Lanzhou University of Technology, Gansu Lanzhou, 730050, P. R. China)

  • Yitong Zhang

    (School of Computer and Communication, Lanzhou University of Technology, Gansu Lanzhou, 730050, P. R. China)

Abstract

Swarm intelligent optimization algorithm plays a key role in solving the influence maximization problem. Aiming at the problems of insufficient diversity and overlapping influence when selecting initial nodes in previous influence maximization algorithms, the local influence measure of nodes is constructed considering the network topology, and the population initialization method based on local influence is proposed. Aiming at the traditional moth-flame algorithm which is difficult to deal with the balance between global exploration and local exploitation, resulting in the decline of population diversity and easy to fall into the local optimal solution, combining with the social learning theory, re-planning the population state, defining multiple learning strategies for individuals in different states, and proposing a new method for the moth-flame algorithm based on the social learning theory to solve the problem of maximizing the influence of the social network. Experiments are conducted on six real social networks under the independent cascade model (IC), and the results show that the proposed algorithm can effectively identify the influential node sets.

Suggested Citation

  • Qiwen Zhang & Yitong Zhang, 2025. "A moth-flame algorithm based on social learning theory for influence maximization," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-24, June.
  • Handle: RePEc:wsi:ijmpcx:v:36:y:2025:i:06:n:s0129183124502371
    DOI: 10.1142/S0129183124502371
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183124502371
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183124502371?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:36:y:2025:i:06:n:s0129183124502371. 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.

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