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

LKG: A fast scalable community-based approach for influence maximization problem in social networks

Author

Listed:
  • Samir, Ahmed M.
  • Rady, Sherine
  • Gharib, Tarek F.

Abstract

The detection of top influential users in social networks is considered one of the current vital research field. The spreading of the information in social networks can be analyzed and sometimes controlled by studying those top influential users. This paper proposes LKG, a fast and scalable hybrid approach to detect top influential users in social networks, suitable for both directed and undirected networks. The LKG hybrid approach consists of three phases: (1) community detection, in which the complete social network is partitioned into related communities using the Louvain algorithm; (2) detection of community top nodes by applying the k-shell decomposition locally in each portioned community; and (3) selection generalization, in which the prior obtained results are generalized for maximizing the spread of influence. Experimental studies were conducted on several datasets with different sizes. The results have been shown to achieve better results for the spread of influence using incomplete social networks than the existing related work models and with far much less processing time.

Suggested Citation

  • Samir, Ahmed M. & Rady, Sherine & Gharib, Tarek F., 2021. "LKG: A fast scalable community-based approach for influence maximization problem in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 582(C).
    • Handle: RePEc:eee:phsmap:v:582:y:2021:i:c:s0378437121005318
    DOI: 10.1016/j.physa.2021.126258
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121005318
    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.2021.126258?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.

    References listed on IDEAS

    as
    1. Kumar, Sanjay & Panda, B.S., 2020. "Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Wu, Rui-Jie & Kong, Yi-Xiu & Di, Zengru & Zhang, Yi-Cheng & Shi, Gui-Yuan, 2022. "Analytical solution to the k-core pruning process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    2. Bouyer, Asgarali & Beni, Hamid Ahmadi, 2022. "Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agrawal, Smita & Patel, Atul, 2021. "SAG Cluster: An unsupervised graph clustering based on collaborative similarity for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    2. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    3. Hajarathaiah, Koduru & Enduri, Murali Krishna & Anamalamudi, Satish, 2022. "Efficient algorithm for finding the influential nodes using local relative change of average shortest path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    4. Lei, Mingli & Cheong, Kang Hao, 2022. "Node influence ranking in complex networks: A local structure entropy approach," Chaos, Solitons & Fractals, Elsevier, vol. 160(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:582:y:2021:i:c:s0378437121005318. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.