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

Social learning-integrated flower pollination algorithm for influence maximization

Author

Listed:
  • Qiwen Zhang

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

  • Yueyue Liu

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

Abstract

Social learning-integrated flower pollination algorithm (SLFPA) is a solution to issues that meta-heuristic algorithms face when solving the influence maximization problem. These issues include the high probability of entrapment in local optima, a decrease in population diversity during later iterations, and low accuracy of solution. In human society, people often learn from others behavior. This mechanism of social learning is incorporated into the flower pollination algorithm. A global pollination strategy is devised to increase population diversity and avoid being trapped in local optima, which utilizes both the global optimal individual and the most improved individual. To enhance the accuracy of the algorithm, we have developed a local pollination strategy that involves creating a learning object based on close friends. We tested the proposed algorithm on six real social networks and compared it to six other advanced heuristic algorithms, and the results demonstrate the effectiveness of algorithm and improved the accuracy of the solution.

Suggested Citation

  • Qiwen Zhang & Yueyue Liu, 2024. "Social learning-integrated flower pollination algorithm for influence maximization," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-23, March.
    • Handle: RePEc:wsi:ijmpcx:v:35:y:2024:i:03:n:s012918312450030x
    DOI: 10.1142/S012918312450030X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S012918312450030X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S012918312450030X?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:35:y:2024:i:03:n:s012918312450030x. 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.