skip to main content
10.5555/3120676.3120705guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Tractable models for information diffusion in social networks

Published: 18 September 2006 Publication History

Abstract

When we consider the problem of finding influential nodes for information diffusion in a large-scale social network based on the Independent Cascade Model (ICM), we need to compute the expected number of nodes influenced by a given set of nodes. However, a good estimate of this quantity needs a large amount of computation in the ICM. In this paper, we propose two natural special cases of the ICM such that a good estimate of this quantity can be efficiently computed. Using real large-scale social networks, we experimentally demonstrate that for extracting influential nodes, the proposed models can provide novel ranking methods that are different from the ICM, typical methods of social network analysis, and "PageRank" method. Moreover, we experimentally demonstrate that when the propagation probabilities through links are small, they can give good approximations to the ICM for finding sets of influential nodes.

References

[1]
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: Proc. WWW 1998, pp. 107-117 (1998)
[2]
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. KDD 2001, pp. 57-66 (2001)
[3]
Goldenberg, K.J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12, 211-223 (2001)
[4]
Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: Proc. WWW 2004, pp. 491-501 (2004)
[5]
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. KDD 2003, pp. 137-146 (2003)
[6]
Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS, vol. 3918, pp. 380-389. Springer, Heidelberg (2006)
[7]
McCallum, A., Corrada-Emmanuel, A., Wang, X.: Topic and role discovery in social networks. In: Proc. IJCAI 2005, pp. 786-791 (2005)
[8]
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
[9]
Newman, M.E.J.: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E 64, 016132 (2001)
[10]
Ng, A.Y., Zheng, A.X., Jordan, M.I.: Link analysis, eigenvectors and stability. In: Proc. IJCAI 2001, pp. 903-901 (2001)
[11]
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814-818 (2005)
[12]
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proc. KDD 2002, pp. 61-70 (2002)
[13]
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
ECMLPKDD'06: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases
September 2006
658 pages
ISBN:3540453741
  • Editors:
  • Johannes Fürnkranz,
  • Tobias Scheffer,
  • Myra Spiliopoulou

Sponsors

  • Pascal
  • Google Inc.
  • Humboldt Univ.: Humboldt-Universität zu Berlin
  • Strato AG: Strato AG
  • IBM: IBM

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 September 2006

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media