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

Time-sensitive Positive Influence Maximization in signed social networks

Author

Listed:
  • Wang, Yuejiao
  • Zhang, Yatao
  • Yang, Fei
  • Li, Dong
  • Sun, Xin
  • Ma, Jun

Abstract

Influence maximization (IM) in social networks has attracted a wide variety of studies motivated by applications like spread of ideas or innovations in a network and viral marketing of products. How to integrate the factors affecting influence diffusion into influence maximization is an key research direction. Timeliness of influence diffusion and the polarity of influence itself are two important factors, which have been used to extend IM problem by researchers. However, all existing studies only focused on one of two factors individually, this will lead time delay of influence propagation or inaccurate influence estimation. Aiming at this drawback, we propose the Time-sensitive Positive Influence Maximization (TP-IM) problem considering two factors simultaneously, to select the seed node set achieving maximum positive influence spread within the specified time limit. Furthermore, we construct the Heat Diffusion-based Polarity Influence Diffusion (HDPID) model and an improved k-Step Greedy seed node selection algorithm, to solve the TP-IM problem. Experimental results on three signed social network datasets, Epinions, Slashdot, and Wikipedia demonstrate that our method outperforms state-of-the-art methods in terms of positive influence spread with time limit.

Suggested Citation

  • Wang, Yuejiao & Zhang, Yatao & Yang, Fei & Li, Dong & Sun, Xin & Ma, Jun, 2021. "Time-sensitive Positive Influence Maximization in signed social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    • Handle: RePEc:eee:phsmap:v:584:y:2021:i:c:s0378437121006269
    DOI: 10.1016/j.physa.2021.126353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121006269
    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.126353?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. Dong Li & Zhi-Ming Xu & Nilanjan Chakraborty & Anika Gupta & Katia Sycara & Sheng Li, 2014. "Polarity Related Influence Maximization in Signed Social Networks," PLOS ONE, Public Library of Science, vol. 9(7), pages 1-12, July.
    2. Guodong Shi & Alexandre Proutiere & Mikael Johansson & John S. Baras & Karl H. Johansson, 2016. "The Evolution of Beliefs over Signed Social Networks," Operations Research, INFORMS, vol. 64(3), pages 585-604, June.
    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. Lin Zhang & Kan Li, 2021. "Influence Maximization Based on Backward Reasoning in Online Social Networks," Mathematics, MDPI, vol. 9(24), pages 1-17, December.
    2. Jabari Lotf, Jalil & Abdollahi Azgomi, Mohammad & Ebrahimi Dishabi, Mohammad Reza, 2022. "An improved influence maximization method for social networks based on genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(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. Edward Anderson & David Gamarnik & Anton Kleywegt & Asuman Ozdaglar, 2016. "Preface to the Special Issue on Information and Decisions in Social and Economic Networks," Operations Research, INFORMS, vol. 64(3), pages 561-563, June.
    2. Jiang, Meiling & Gao, Qingwu & Zhuang, Jun, 2021. "Reciprocal spreading and debunking processes of online misinformation: A new rumor spreading–debunking model with a case study," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    3. Jan Hk{a}z{l}a & Yan Jin & Elchanan Mossel & Govind Ramnarayan, 2019. "A Geometric Model of Opinion Polarization," Papers 1910.05274, arXiv.org, revised Aug 2021.
    4. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska, 2023. "On the Design of Public Debate in Social Networks," Operations Research, INFORMS, vol. 71(2), pages 626-648, March.
    5. Low, Nicholas Kah Yean & Melatos, Andrew, 2022. "Vacillating about media bias: Changing one’s mind intermittently within a network of political allies and opponents," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    6. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska, 2022. "On the design of public debate in social networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-03770884, HAL.
    7. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska, 2022. "On the design of public debate in social networks," PSE-Ecole d'économie de Paris (Postprint) hal-03770884, HAL.
    8. Jiangbo Zhang & Yiyi Zhao, 2023. "Dynamics Analysis for the Random Homogeneous Biased Assimilation Model," Mathematics, MDPI, vol. 11(7), pages 1-17, March.
    9. Antonio Parravano & Ascensión Andina-Díaz & Miguel A Meléndez-Jiménez, 2016. "Bounded Confidence under Preferential Flip: A Coupled Dynamics of Structural Balance and Opinions," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-23, October.
    10. Ferreira, Anderson A. & Ferreira, Leandro A. & Mihara, Antonio & Ferreira, Fernando F., 2020. "A stochastic quenched disorder model for interaction of network-master node systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 556(C).
    11. Hai-Bo Hu & Cang-Hai Li & Qing-Ying Miao, 2017. "Opinion Diffusion On Multilayer Social Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 20(06n07), pages 1-25, September.
    12. Low, Nicholas Kah Yean & Melatos, Andrew, 2022. "Discerning media bias within a network of political allies and opponents: The idealized example of a biased coin," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    13. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska, 2022. "On the design of public debate in social networks," Post-Print hal-03770884, HAL.

    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:584:y:2021:i:c:s0378437121006269. 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.