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

An adaptive discrete particle swarm optimization for influence maximization based on network community structure

Author

Listed:
  • Jianxin Tang

    (School of Computer and Communication, Lanzhou University of Technology, Lanzhou, Gansu 730050, P. R. China†School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

  • Ruisheng Zhang

    (#x2020;School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

  • Yabing Yao

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

  • Zhili Zhao

    (#x2020;School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

  • Baoqiang Chai

    (#x2020;School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

  • Huan Li

    (#x2020;School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, P. R. China)

Abstract

As an important research field of social network analysis, influence maximization problem is targeted at selecting a small group of influential nodes such that the spread of influence triggered by the seed nodes will be maximum under a given propagation model. It is yet filled with challenging research topics to develop effective and efficient algorithms for the problem especially in large-scale social networks. In this paper, an adaptive discrete particle swarm optimization (ADPSO) is proposed based on network topology for influence maximization in community networks. According to the framework of ADPSO, community structures are detected by label propagation algorithm in the first stage, then dynamic encoding mechanism for particle individuals and discrete evolutionary rules for the swarm are conceived based on network community structure for the meta-heuristic optimization algorithm to identify the allocated number of influential nodes within different communities. To expand the seed nodes reasonably, a local influence preferential strategy is presented to allocate the number of candidate nodes to each community according to its marginal gain. The experimental results on six social networks demonstrate that the proposed ADPSO can achieve comparable influence spread to CELF in an efficient way.

Suggested Citation

  • Jianxin Tang & Ruisheng Zhang & Yabing Yao & Zhili Zhao & Baoqiang Chai & Huan Li, 2019. "An adaptive discrete particle swarm optimization for influence maximization based on network community structure," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(06), pages 1-21, June.
    • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:06:n:s0129183119500505
    DOI: 10.1142/S0129183119500505
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119500505
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183119500505?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Pei & Liu, Ke & Li, Keqin & Liu, Jianxun & Zhou, Dong, 2021. "Estimating user influence ranking in independent cascade model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).

    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:30:y:2019:i:06:n:s0129183119500505. 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.