Skip to main content

Interaction-Aware Influence Maximization and Iterated Sandwich Method

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11640))

Abstract

Influence maximization problem has been studied extensively with the development of online social networks. Most of the existing works focus on the maximization of influence spread under the assumption that the number of influenced users determines the success of a product promotion. However, the profit of some products such as online game depends on the interactions among users besides the number of users. In this paper, we take both the number of active users and the user-to-user interactions into account and propose the interaction-aware influence maximization problem. To address this practical issue, we analyze its complexity and modularity, propose the sandwich theory which is based on decomposing the non-submodular objective function into the difference of two submodular functions and design iterated sandwich algorithm which is guaranteed to get data dependent approximation solution.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Chen, W., et al.: Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 SIAM International Conference on Data Mining, pp. 379–390. SIAM (2011)

    Google Scholar 

  2. 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 (2009)

    Google Scholar 

  3. 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, KDD 2001, pp. 57–66. ACM (2001)

    Google Scholar 

  4. Fox, J., Gilbert, M., Tang, W.Y.: Player experiences in a massively multiplayer online game: a diary study of performance, motivation, and social interaction. New Media Soc. (2018). https://doi.org/10.1177/1461444818767102

    Article  Google Scholar 

  5. Han, M., Li, J., Cai, Z., Han, Q.: Privacy reserved influence maximization in GPS-enabled cyber-physical and online social networks. In: 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), pp. 284–292. IEEE (2016)

    Google Scholar 

  6. Iyer, R., Bilmes, J.: Algorithms for approximate minimization of the difference between submodular functions, with applications. In: Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2012, pp. 407–417. AUAI Press, Arlington (2012)

    Google Scholar 

  7. 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 (2012)

    Google Scholar 

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

    Google Scholar 

  9. 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 (2007)

    Google Scholar 

  10. Li, Y., Zhang, D., Tan, K.-L.: Real-time targeted influence maximization for online advertisements. Proc. VLDB Endow. 8(10), 1070–1081 (2015)

    Article  Google Scholar 

  11. Narasimhan, M., Bilmes, J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, UAI 2005, pp. 404–412. AUAI Press, Arlington (2005)

    Google Scholar 

  12. 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, KDD 2002, pp. 61–70. ACM (2002)

    Google Scholar 

  13. Rodriguez, M.G., Schölkopf, B.: Influence maximization in continuous time diffusion networks. arXiv preprint arXiv:1205.1682 (2012)

  14. Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374–2387 (2017)

    Article  Google Scholar 

  15. Wu, W.-L., Zhang, Z., Du, D.-Z.: Set function optimization. J. Oper. Res. Soc. China 7, 1–11 (2018)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The work is supported by Natural Science Foundation of China (No. 61672321, 61771289, 61832012, 61373027).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiguo Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gao, C., Gu, S., Yang, R., Yu, J., Wu, W., Xu, D. (2019). Interaction-Aware Influence Maximization and Iterated Sandwich Method. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27195-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27194-7

  • Online ISBN: 978-3-030-27195-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics