IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/3101042.html
   My bibliography  Save this article

A New Discrete Grid-Based Bacterial Foraging Optimizer to Solve Complex Influence Maximization of Social Networks

Author

Listed:
  • Yichuan Zhang
  • Yibo Yong
  • Shujun Yang
  • Tian Zhang
  • Shangce Gao

Abstract

Influence maximization (IM) is fundamental to social network applications. It aims to find multiple seed nodes with an enormous impact cascade to maximize these nodes’ spread of influence in social networks. Traditional methods for solving influence maximization of the social network, such as the distance method, greedy method, and PageRank method, may suffer from issues of low calculation accuracy and high computational cost. In this paper, we propose a new bacterial foraging optimization algorithm to solve the IM problem based on the complete-three-layer-influence (CTLI) evaluation model. In this algorithm, a novel grid-based reproduction strategy and a direction-adjustment-based chemotaxis strategy are devised to enhance the algorithm’s searchability. Finally, we conduct comprehensive experiments on four social network cases to verify the effectiveness of the proposed algorithm. The experimental results show that our proposed algorithm effectively solves the social network’s influence maximization.

Suggested Citation

  • Yichuan Zhang & Yibo Yong & Shujun Yang & Tian Zhang & Shangce Gao, 2021. "A New Discrete Grid-Based Bacterial Foraging Optimizer to Solve Complex Influence Maximization of Social Networks," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-13, October.
  • Handle: RePEc:hin:jnddns:3101042
    DOI: 10.1155/2021/3101042
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2021/3101042.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2021/3101042.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/3101042?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnddns:3101042. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.