Skip to main content
SpringerLink
Log in

Social Influence-Based Optimization Problems

  • Chapter
  • First Online:
Open Problems in Optimization and Data Analysis

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 141))

  • 1737 Accesses

Abstract

The social influence is an important research subject in computational social networks. There are many optimization problems stemmed from study of social influence. In this article, we select a few of them to present a small survey in the literature and existing open problems about them.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agaskar, A., Lu, Y.M.: A fast Monte Carlo algorithm for source localization on graphs. In: SPIE Optical Engineering+ Applications, p. 88581N. International Society for Optics and Photonics, San Diego (2013)

    Google Scholar 

  2. Badanidiyuru, A., Papadimitriou, C., Rubinstein, A., Seeman, L., Singer, Y.: Locally adaptive optimization: adaptive seeding for monotone submodular functions (2015). Preprint. arXiv:1507.02351

    Google Scholar 

  3. Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: International Workshop on Web and Internet Economics, pp. 306–311. Springer, Berlin (2007)

    Google Scholar 

  4. Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. SIAM, Philadelphia (2014)

    Google Scholar 

  5. Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Internet and Network Economics, pp. 539–550. Springer, Berlin (2010)

    Google Scholar 

  6. Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 665–674. ACM, New York (2011)

    Google Scholar 

  7. Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208. ACM, New York (2009)

    Google Scholar 

  8. Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029–1038. ACM, New York (2010)

    Google Scholar 

  9. Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: IEEE 10th International Conference on Data Mining (ICDM), 2010, pp. 88–97. IEEE, Piscataway (2010)

    Google Scholar 

  10. Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and influence propagation in social networks. Synth. Lectures Data Manag. 5(4), 1–177 (2013)

    Article  Google Scholar 

  11. Chen, H., Xu W., Zhai, X., Bi, Y., Wang, A., Du, D.-Z.: How could a boy influence a girl? In: 10th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), 2014, pp. 279–287. IEEE, Piscataway (2014)

    Google Scholar 

  12. Chen, W., Li, F., Lin, T., Rubinstein, A.: Combining traditional marketing and viral marketing with amphibious influence maximization. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 779–796. ACM, New York (2015)

    Google Scholar 

  13. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM, New York (2001)

    Google Scholar 

  14. Dong, W., Zhang, W., Tan, C.W.: Rooting out the rumor culprit from suspects. In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2671–2675. IEEE, Piscataway (2013)

    Google Scholar 

  15. Ennals, R., Byler, D., Agosta, J. M., Rosario, B.: What is disputed on the web? In: Proceedings of the 4th Workshop on Information Credibility, WICOW ’10, New York, NY, 2010, pp. 67–74. ACM, New York (2010)

    Google Scholar 

  16. Fan, L., Lu, Z., Wu, W., Thuraisingham, B., Ma, H., Bi, Y.: Least cost rumor blocking in social networks. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 540–549. IEEE, Piscataway (2013)

    Google Scholar 

  17. Fan, L., Wu, W., Zhai, X., Xing, K., Lee, W., Du, D.-Z.: Maximizing rumor containment in social networks with constrained time. Soc. Netw. Anal. Min. 4(1), 1–10 (2014)

    Article  Google Scholar 

  18. Garrison, J., Knoll, C.: Prop. 8 opponents rally across California to protest gay-marriage ban. Los Angeles Times (2008)

    Google Scholar 

  19. Goyal, A., Lu, W., Lakshmanan, L.V.S.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47–48. ACM, New York (2011)

    Google Scholar 

  20. Goyal, A., Lu, W., Lakshmanan, L.V.S.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 211–220. IEEE, Piscataway (2011)

    Google Scholar 

  21. He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: SDM, pp. 463–474. SIAM, New York (2012)

    Chapter  Google Scholar 

  22. Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated annealing based influence maximization in social networks. In: AAAI, vol. 11, pp. 127–132 (2011)

    Google Scholar 

  23. Jung, K., Heo, W., Chen, W.: IRIE: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), pp. 918–923. IEEE, Piscataway (2012)

    Google Scholar 

  24. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, New York (2003)

    Google Scholar 

  25. Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Automata, Languages and Programming, pp. 1127–1138. Springer, Berlin (2005)

    Chapter  Google Scholar 

  26. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105–147 (2015)

    Article  MathSciNet  Google Scholar 

  27. Kim, S.: Friend recommendation with a target user in social networking services. In: 2015 31st IEEE International Conference on Data Engineering Workshops (ICDEW), pp. 235–239. IEEE, Piscataway (2015)

    Google Scholar 

  28. Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: Knowledge Discovery in Databases: PKDD 2006, pp. 259–271. Springer, Berlin (2006)

    Google Scholar 

  29. Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: AAAI, vol. 7, pp. 1371–1376 (2007)

    Google Scholar 

  30. Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: AAAI, vol. 8, pp. 1175–1180 (2008)

    Google Scholar 

  31. Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of mouth: rumor dissemination in social networks. In: Structural Information and Communication Complexity, pp. 185–196. Springer, Berlin (2008)

    Google Scholar 

  32. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM, New York (2007)

    Google Scholar 

  33. Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 497–506. ACM, New York (2009)

    Google Scholar 

  34. Liu, Q., Xiang, B., Chen, E., Xiong, H., Tang, F., Yu, J.X.: Influence maximization over large-scale social networks: a bounded linear approach. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 171–180. ACM, New York (2014)

    Google Scholar 

  35. Lu, Z., Zhang, W., Wu, W., Fu, B., Du, D.: Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: 2011 31st International Conference on Distributed Computing Systems Workshops (ICDCSW), pp. 160–165. IEEE, Piscataway (2011)

    Google Scholar 

  36. Lu, Z., Zhang, Z., Wu, W.: Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 33(2), 803–808 (2017)

    Article  MathSciNet  Google Scholar 

  37. Luckerson, V.: Fear, misinformation, and social media complicate Ebola fight. Time (2014)

    Google Scholar 

  38. Luo, W., Tay, W.P.: Identifying multiple infection sources in a network. In: 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), pp. 1483–1489. IEEE, Piscataway (2012)

    Google Scholar 

  39. Luo, W., Tay, W.P.: Estimating infection sources in a network with incomplete observations. In: 2013 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 301–304. IEEE, Piscataway (2013)

    Google Scholar 

  40. Luo, W., Tay, W.P.: Finding an infection source under the sis model. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2930–2934. IEEE, Piscataway (2013)

    Google Scholar 

  41. Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: Proceedings of the 4th Annual ACM Web Science Conference, pp. 213–222. ACM, New York (2012)

    Google Scholar 

  42. Qazvinian, V., Rosengren, E., Radev, D.R., Mei, Q.: Rumor has it: Identifying misinformation in microblogs. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp. 1589–1599. Association for Computational Linguistics, Stroudsburg (2011)

    Google Scholar 

  43. Ratkiewicz, J., Conover, M., Meiss, M., Gonçalves, B., Patil, S., Flammini, A., Menczer, F.: Truthy: mapping the spread of astroturf in microblog streams. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 249–252. ACM, New York (2011)

    Google Scholar 

  44. Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70. ACM, New York (2002)

    Google Scholar 

  45. Seo, E., Mohapatra, P., Abdelzaher, T.: Identifying rumors and their sources in social networks. In: SPIE defense, security, and sensing, pp. 83891I–83891I. International Society for Optics and Photonics, San Diego (2012)

    Google Scholar 

  46. Shah, D., Zaman, T.: Finding sources of computer viruses in networks: theory and experiment. In: Proceedings of ACM Sigmetrics, vol. 15, pp. 5249–5262 (2010)

    Google Scholar 

  47. Shah, D., Zaman, T.: Rumors in a network: who’s the culprit? IEEE Trans. Inf. Theory 57(8), 5163–5181 (2011)

    Article  MathSciNet  Google Scholar 

  48. Shah, D., Zaman, T.: Rumor centrality: a universal source detector. In: ACM SIGMETRICS Performance Evaluation Review, vol. 40, pp. 199–210. ACM, New York (2012)

    Article  Google Scholar 

  49. Trpevski, D., Tang, W.K.S., Kocarev, L.: Model for rumor spreading over networks. Phys. Rev. E 81(5), 056102 (2010)

    Article  Google Scholar 

  50. Wang, Y., Cong, G., Song, G., Xie, K.: 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. ACM, New York (2010)

    Google Scholar 

  51. Wang, C., Chen, W., Wang, Y.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Disc. 25(3), 545–576 (2012)

    Article  MathSciNet  Google Scholar 

  52. Wang, A., Wu, W., Cui, L.: On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 31(4), 1678–1684 (2016)

    Article  MathSciNet  Google Scholar 

  53. Xu, W., Lu, Z., Wu, W., Chen, Z.: A novel approach to online social influence maximization. Soc. Netw. Anal. Min. 4(1), 1–13 (2014)

    Article  Google Scholar 

  54. Yang, D.-N., Hung, H.-J., Lee, W.-C., Chen, W.: Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 713–721. ACM, New York (2013)

    Google Scholar 

  55. Zhu, K., Ying, L.: Information source detection in the SIR model: a sample path based approach. In: Information Theory and Applications Workshop (ITA), 2013, pp. 1–9. IEEE, New York (2013)

    Google Scholar 

  56. Zhu, K., Ying, L.: A robust information source estimator with sparse observations. Comput. Soc. Netw. 1(1), 1–21 (2014)

    Article  Google Scholar 

  57. Zhu, Y., Wu, W., Bi, Y., Wu, L., Jiang, Y., Xu, W.: Better approximation algorithms for influence maximization in online social networks. J. Comb. Optim. 30(1), 97–108 (2015)

    Article  MathSciNet  Google Scholar 

  58. Zhu, Y., Li, D., Zhang, Z.: Minimum cost seed set for competitive social influence. InfoCom 2016 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA

    Chao Li, Jing Yuan & Ding-Zhu Du

Authors
  1. Chao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ding-Zhu Du .

Editor information

Editors and Affiliations

  1. Industrial and Systems, Engineering Department, University of Florida, Center For Applied Optimization, Gainesville, FL, USA

    Panos M. Pardalos

  2. Industrial Logistics, ETS Institute, Lulea University of Technology, Norrbotten, Sweden

    Athanasios Migdalas

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, C., Yuan, J., Du, DZ. (2018). Social Influence-Based Optimization Problems. In: Pardalos, P., Migdalas, A. (eds) Open Problems in Optimization and Data Analysis. Springer Optimization and Its Applications, vol 141. Springer, Cham. https://doi.org/10.1007/978-3-319-99142-9_2

Download citation

Publish with us

Policies and ethics

Search

Navigation