Advertisement

Influence Maximisation

  • Krishna Raj P. M.Email author
  • Ankith Mohan
  • K. G. Srinivasa
Chapter
Part of the Computer Communications and Networks book series (CCN)

Abstract

Influence maximization is a NP-hard problem which involves finding k seed nodes among all the nodes in a directed network, such that activating them leads to the maximum expected number of activated nodes. In this chapter, we will learn a \(63\%\)-optimal approximate solution. The chapter will also look at viral marketing strategies where a customer’s value is not only limited by her intrinsic value but also includes her network value. Studies of these ideas on EachMovie and Epinions will also be covered. We will briefly look at the CELF and SIMPATH algorithms.

References

  1. 1.
    Bakshy, Eytan, J.M. Hofman, W.A. Mason, and D.J. Watts. 2011. Everyone’s an influencer: quantifying influence on twitter. In Proceedings of the fourth ACM international conference on Web search and data mining, 65–74. ACM.Google Scholar
  2. 2.
    Chen, Wei, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 199–208. ACM.Google Scholar
  3. 3.
    Chen, Wei , Yifei Yuan, and Li Zhang. 2010. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE 10th international conference on data mining (ICDM), 88–97. IEEE.Google Scholar
  4. 4.
    Domingos, Pedro, and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 57–66. ACM.Google Scholar
  5. 5.
    Goldenberg, Jacob, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12 (3): 211–223.CrossRefGoogle Scholar
  6. 6.
    Goyal, Amit, Wei Lu, and Laks V.S. Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th international conference on data mining (ICDM), 211–220. IEEE.Google Scholar
  7. 7.
    Granovetter, Mark S. 1977. The strength of weak ties. In Social networks, 347–367. Elsevier.Google Scholar
  8. 8.
    Kempe, David, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 137–146. ACM.Google Scholar
  9. 9.
    Leskovec, Jure, Lada A. Adamic, and Bernardo A. Huberman. 2007. The dynamics of viral marketing. ACM Transactions on the Web (TWEB) 1 (1): 5.CrossRefGoogle Scholar
  10. 10.
    Leskovec, Jure, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne Van Briesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 420–429. ACM.Google Scholar
  11. 11.
    Resnick, Paul, Neophytos Iacovou, Mitesh Suchak, Peter Bergstrom, and John Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the 1994 ACM conference on computer supported cooperative work, 175–186. ACM.Google Scholar
  12. 12.
    Richardson, Matthew, and Pedro Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, 61–70. ACM.Google Scholar
  13. 13.
    Singer, Yaron. 2012. How to win friends and influence people, truthfully: Influence maximization mechanisms for social networks. In Proceedings of the fifth ACM international conference on web search and data mining, 733–742. ACM.Google Scholar
  14. 14.
    Watts, Duncan J., and Peter Sheridan Dodds. 2007. Influentials, networks, and public opinion formation. Journal of Consumer Research 34 (4): 441–458.CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Krishna Raj P. M.
    • 1
    Email author
  • Ankith Mohan
    • 1
  • K. G. Srinivasa
    • 2
  1. 1.Department of ISERamaiah Institute of TechnologyBangaloreIndia
  2. 2.Department of Information TechnologyC.B.P. Government Engineering CollegeJaffarpurIndia

Personalised recommendations