Skip to main content
SpringerLink
Log in

Retrieving the maximal time-bounded positive influence set from social networks

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

The appearance of social networks provides great opportunities for people to communicate, share and disseminate information. Meanwhile, it is quite challenge for utilizing a social networks efficiently in order to increase the commercial profit or alleviate social problems. One feasible solution is to select a subset of individuals that can positively influence the maximum other ones in the given social network, and some algorithms have been proposed to solve the optimal individual subset selection problem. However, most of the existing works ignored the constraint on time. They assume that the time is either infinite or only suitable to solve the snapshot selection problems. Obviously, both of them are impractical in the real system. Due to such reason, we study the problem of selecting the optimal individual subset to diffuse the positive influence when time is bounded. We proved that such a problem is NP-hard, and a heuristic algorithm based on greedy strategy is proposed. The experimental results on both simulation and real-world social networks based on the trace data in Shanghai show that our proposed algorithm outperforms the existing algorithms significantly, especially when the network structure is sparse.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. http://www.tns-opinion.com/sites/default/files/THINK%209.pdf

  2. Suvnet-trace data. http://wirelesslab.sjtu.edu.cn

  3. Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process[J]. arXiv:1204.3074

  4. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 199–208

  5. Dai W, Wang Y, Jin Q, Ma J (2016) An integrated incentive framework for mobile crowdsourced sensing. Tsinghua Sci Technol 21(2):146–156

    Article  Google Scholar 

  6. Dinh T, Shen Y, Nguyen D, Thai M (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27(3):487–503

    Article  MathSciNet  MATH  Google Scholar 

  7. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75–174

    Article  MathSciNet  Google Scholar 

  8. Gao X, Wang Y, Li X, Wu W (2009) Analysis on theoretical bonds for approximating dominating set problems. Discrete Math Algorithms Appl 1(1):71–84

    Article  MathSciNet  MATH  Google Scholar 

  9. He Z, Cai Z, Han Q, Tong W, Sun L, Li Y (2016) An energy efficient privacy-preserving content sharing scheme in mobile social networks. Pers Ubiquitous Comput

  10. He Z, Cai Z, Wang X (2015) Modeling propagation dynamics and developing optimized countermeasures for rumor spreading in online social networks. In: The 35th IEEE international conference on distributed computing systems, pp 205–214

  11. He Z, Cai Z, Yu J, et al. Cost-efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks[J].

  12. Jaccard J, Blanton H, Dodge T (2005) Peer influences on risk behavior: analysis of the effects of a close friend. Dev Psychol 41(1):135–147

    Article  Google Scholar 

  13. Jung K, Heo W, Chen W (2011) Irie: a scalable influence maximization algorithm for independent cascade model and its extensions. arXiv preprint arXiv:1111.4795

  14. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: SIGKDD, pp 461–467

  15. Kim D, Li D, Asgari O, Li Y, Tokuta AO (2013) A dominating set based approach to identify effective leader group of social network. In: COCOON, pp 841–848

  16. Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Principles and practice of knowledge discovery in databases, pp 259–271

  17. Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429

  18. Leskovec J, Sosič R (2014) SNAP: a general purpose network analysis and graph mining library in C++. http://snap.stanford.edu/snap

  19. Liu X, Li S, Liao X, Wang L, Wu Q (2012) In-time estimation for influence maximization in large-scale social networks. In: Proceedings of the fifth workshop on social network systems, pp 1–6

  20. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD conference on knowledge discovery and data mining, pp 61–70

  21. Sheldon D, Dilkina B, Elmachtoub A, Finseth R et al (2012) Maximizing the spread of cascades using network design. arXiv preprint arXiv:1203.3514

  22. Wang F, Du H, Camacho E, Xu K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412(3):265–269

    Article  MathSciNet  MATH  Google Scholar 

  23. Wang X, Lin Y, Zhang S, et al (2015) A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters[J]. Enterp Inf Syst, pp 1–30.

  24. Wang Y, Cai Z, Yin G, et al (2015) A trust measurement in social networks based on game theory[C]//International Conference on Computational Social Networks. Springer International Publishing, pp 236–247

  25. Wang Y, Cai Z, Yin G, Gao Y, Tong X, Wu G (2016) A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Comput Netw 102:157–171

    Article  Google Scholar 

  26. Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1039–1048

  27. Wang Y, Yin G, Cai Z, Dong Y, Dong H (2015) A trust-based probabilistic recommendation model for social networks. J Netw Comput Appl 55:59–67

    Article  Google Scholar 

  28. Zhang L, Cai Z, Wang X (2016) Fakemask: a novel privacy preserving approach for smartphones. IEEE Trans Netw Serv Manag 13(2):335–348

    Article  MathSciNet  Google Scholar 

  29. Zhang L, Wang X, Lu J, et al (2014) A novel contact prediction‐based routing scheme for DTNs[J]. Transactions on Emerging Telecommunications Technologies. Trans Emerg Telecommun Technol

  30. Zhang W, Wu W, Wang F, Xu K (2011) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2(1):31–37

    Article  Google Scholar 

Download references

Acknowledgments

This work is partly supported by the NSF under Grant No. 1252292, National Natural Science Foundation of China under Grant NOs. 61502116, 61190115, 61370217, the National Basic Research Program of China (973 Program) under Grant No. 2012CB316200, the Fundamental Research Funds for the Central Universities under Grant No. HIT.KISTP201415, the National Science Foundation (NSF) under Grant Nos. CNS-1152001, CNS-1252292, the Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20132302120045 and the Natural Scientific Research Innovation Foundation in Harbin Institute of Technology under Grant No. HIT.NSRIF.2014070.

Author information

Authors and Affiliations

  1. Harbin Institute of Technology, Harbin, China

    Tuo Shi, Siyao Cheng & Jianzhong Li

  2. Georgia State University, Atlanta, GA, USA

    Zhipeng Cai & Yingshu Li

Authors
  1. Tuo Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siyao Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhipeng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yingshu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jianzhong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siyao Cheng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, T., Cheng, S., Cai, Z. et al. Retrieving the maximal time-bounded positive influence set from social networks. Pers Ubiquit Comput 20, 717–730 (2016). https://doi.org/10.1007/s00779-016-0943-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-016-0943-7

Keywords

Search

Navigation