Advertisement

Tracing Influential Nodes in a Social Network with Competing Information

  • Bolei Zhang
  • Zhuzhong Qian
  • Xiaoliang Wang
  • Sanglu Lu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7819)

Abstract

We consider the problem of competitive influence maximization where multiple pieces of information are spreading simultaneously in a social network. In this problem, we need to identify a small number of influential nodes as first adopters of our information so that the information can be spread to as many nodes as possible with competition against adversary information. We first propose a generalized model of competitive information diffusion by explicitly characterizing the preferences of nodes. Under this generalized model, we show that the influence spreading process is no longer submodular, which implies that the widely used greedy algorithm does not have performance guarantee. So we propose a simple yet effective heuristic algorithm by tracing the information back according to a properly designed random walk on the network, based on the postulation that all initially inactive nodes can be influenced by our information. Extensive experiments are conducted to evaluate the performance of our algorithm. The results show that our algorithm outperforms many other algorithms in most cases, and is very scalable due to its low running time.

Keywords

Social Network Random Walk Greedy Algorithm Collaboration Network Spreading Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)Google Scholar
  2. 2.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: KDD, pp. 420–429 (2007)Google Scholar
  3. 3.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199–208 (2009)Google Scholar
  4. 4.
    Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp.1029–1038 (2010)Google Scholar
  5. 5.
    Zhang, Y., Gu, Q., Zheng, J., Chen, D.: Estimate on Expectation for Influence Maximization in Social Networks. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS, vol. 6118, pp. 99–106. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Tang, J., Sun, J., Wang, C., Yang, Z.: Social influence analysis in large-scale networks. In: KDD, pp. 807–816 (2009)Google Scholar
  7. 7.
    Jo, Y., Hopcroft, J.E., Lagoze, C.: The web of topics: discovering the topology of topic evolution in a corpus. In: WWW, pp. 257–266 (2011)Google Scholar
  8. 8.
    Gomez-Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: KDD, pp. 1019–1028 (2010)Google Scholar
  9. 9.
    Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: WWW, pp. 665–674 (2011)Google Scholar
  10. 10.
    Bharathi, S., Kempe, D., Salek, M.: Competitive Influence Maximization in Social Networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of Mouth: Rumor Dissemination in Social Networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185–196. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Pathak, N., Banerjee, A., Srivastava, J.: A Generalized Linear Threshold Model for Multiple Cascades. In: ICDM, pp. 965–970 (2010)Google Scholar
  13. 13.
    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 (2012)Google Scholar
  14. 14.
    Borodin, A., Filmus, Y., Oren, J.: Threshold Models for Competitive Influence in Social Networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. Stanford InfoLab (1999)Google Scholar
  16. 16.
    Kimura, M., Saito, K.: Tractable Models for Information Diffusion in Social Networks. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259–271. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Collaboration networks, http://snap.stanford.edu/data/

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Bolei Zhang
    • 1
  • Zhuzhong Qian
    • 1
  • Xiaoliang Wang
    • 1
  • Sanglu Lu
    • 1
  1. 1.National Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingChina

Personalised recommendations