IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v526y2019ics0378437119305680.html
   My bibliography  Save this article

Efficient and effective influence maximization in large-scale social networks via two frameworks

Author

Listed:
  • Yuan, Jinliang
  • Zhang, Ruisheng
  • Tang, Jianxin
  • Hu, Rongjing
  • Wang, Zepeng
  • Li, Huan

Abstract

Influence maximization is to find a small subset of nodes in a network so that the scope of influence spread can be maximized, and it is a significant optimization problem in rumor control and viral marketing. Although there have been a lot of research works for this problem, it is still difficult to design algorithms to meet three requirements simultaneously, i.e., fast computation, low memory consumption and guaranteed accuracy when scaling to large-scale networks. In this paper, we research the efficient and effective influence maximization algorithms from two directions. One is to design an effective similarity-based framework for enhancing the influence spread of the centrality-based heuristic algorithms, and another is to improve greedy algorithm for efficiency by a two-stage framework. The extensive experiments in undirected and directed networks all demonstrate that two heuristic algorithms using the proposed framework acquire comparable results to the state of the art and are two orders of magnitude faster than D-SSA in a million of network. Simultaneously, the improved greedy algorithm is 2 to 12 times faster than CELF with the almost same influence spread.

Suggested Citation

  • Yuan, Jinliang & Zhang, Ruisheng & Tang, Jianxin & Hu, Rongjing & Wang, Zepeng & Li, Huan, 2019. "Efficient and effective influence maximization in large-scale social networks via two frameworks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 526(C).
    • Handle: RePEc:eee:phsmap:v:526:y:2019:i:c:s0378437119305680
    DOI: 10.1016/j.physa.2019.04.202
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119305680
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.04.202?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. Gong, Yudong & Liu, Sanyang & Bai, Yiguang, 2021. "A probability-driven structure-aware algorithm for influence maximization under independent cascade model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(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:eee:phsmap:v:526:y:2019:i:c:s0378437119305680. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.