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

Influence maximization in social networks under an independent cascade-based model

Author

Listed:
  • Wang, Qiyao
  • Jin, Yuehui
  • Lin, Zhen
  • Cheng, Shiduan
  • Yang, Tan

Abstract

The rapid growth of online social networks is important for viral marketing. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. An independent cascade-based model for influence maximization, called IMIC-OC, was proposed to calculate positive influence. We assumed that influential users spread positive opinions. At the beginning, users held positive or negative opinions as their initial opinions. When more users became involved in the discussions, users balanced their own opinions and those of their neighbors. The number of users who did not change positive opinions was used to determine positive influence. Corresponding influential users who had maximum positive influence were then obtained. Experiments were conducted on three real networks, namely, Facebook, HEP-PH and Epinions, to calculate maximum positive influence based on the IMIC-OC model and two other baseline methods. The proposed model resulted in larger positive influence, thus indicating better performance compared with the baseline methods.

Suggested Citation

  • Wang, Qiyao & Jin, Yuehui & Lin, Zhen & Cheng, Shiduan & Yang, Tan, 2016. "Influence maximization in social networks under an independent cascade-based model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 20-34.
    • Handle: RePEc:eee:phsmap:v:444:y:2016:i:c:p:20-34
    DOI: 10.1016/j.physa.2015.10.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437115008663
    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.2015.10.020?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. Si, Xia-Meng & Liu, Yun & Xiong, Fei & Zhang, Yan-Chao & Ding, Fei & Cheng, Hui, 2010. "Effects of selective attention on continuous opinions and discrete decisions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(18), pages 3711-3719.
    2. Heidari, Mehdi & Asadpour, Masoud & Faili, Hesham, 2015. "SMG: Fast scalable greedy algorithm for influence maximization in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 124-133.
    3. Wu, Yanlei & Yang, Yang & Jiang, Fei & Jin, Shuyuan & Xu, Jin, 2014. "Coritivity-based influence maximization in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 467-480.
    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. Wang, Qiyao & Jin, Yuehui & Cheng, Shiduan & Yang, Tan, 2017. "ConformRank: A conformity-based rank for finding top-k influential users," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 474(C), pages 39-48.
    2. Fei Wang & Zhenfang Zhu & Peiyu Liu & Peipei Wang, 2019. "Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect," Future Internet, MDPI, vol. 11(4), pages 1-16, April.

    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. Si, Xia-Meng & Wang, Wen-Dong & Ma, Yan, 2016. "Role of propagation thresholds in sentiment-based model of opinion evolution with information diffusion," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 549-559.
    2. Xiaodong Liu & Xiangke Liao & Shanshan Li & Si Zheng & Bin Lin & Jingying Zhang & Lisong Shao & Chenlin Huang & Liquan Xiao, 2017. "On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks," Complexity, Hindawi, vol. 2017, pages 1-14, September.
    3. Charikhi, Mourad, 2024. "Association of the PageRank algorithm with similarity-based methods for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    4. Li, Shudong & Zhao, Dawei & Wu, Xiaobo & Tian, Zhihong & Li, Aiping & Wang, Zhen, 2020. "Functional immunization of networks based on message passing," Applied Mathematics and Computation, Elsevier, vol. 366(C).
    5. Xiao, Yunpeng & Wang, Zheng & Li, Qian & Li, Tun, 2019. "Dynamic model of information diffusion based on multidimensional complex network space and social game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 578-590.
    6. Zhao, Jiuhua & Liu, Qipeng & Wang, Lin & Wang, Xiaofan, 2017. "Competitive seeds-selection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 240-248.
    7. Diao, Su-Meng & Liu, Yun & Zeng, Qing-An & Luo, Gui-Xun & Xiong, Fei, 2014. "A novel opinion dynamics model based on expanded observation ranges and individuals’ social influences in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 415(C), pages 220-228.
    8. Yan, Fuhan & Li, Zhaofeng & Jiang, Yichuan, 2016. "Controllable uncertain opinion diffusion under confidence bound and unpredicted diffusion probability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 449(C), pages 85-100.
    9. Tang, Jianxin & Zhang, Ruisheng & Yao, Yabing & Yang, Fan & Zhao, Zhili & Hu, Rongjing & Yuan, Yongna, 2019. "Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 477-496.
    10. Si, Xia-Meng & Wang, Wen-Dong & Zhai, Chun-Qing & Ma, Yan, 2017. "A topic evolution model with sentiment and selective attention," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 480-491.
    11. Juanjuan Zhao & Weili Wu & Xiaolong Zhang & Yan Qiang & Tao Liu & Lidong Wu, 2014. "A short-term trend prediction model of topic over Sina Weibo dataset," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 613-625, October.

    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:444:y:2016:i:c:p:20-34. 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.