Skip to main content

Minimizing the Social Influence from a Topic Modeling Perspective

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9208))

Abstract

In this paper, we address the problem of minimizing the negative influence of undesirable things in a network by blocking a limited number of nodes from a topic modeling perspective. When undesirable thing such as a rumor or an infection emerges in a social network and part of users have already been infected, our goal is to minimize the size of ultimately infected users by blocking k nodes outside the infected set. We first employ the HDP-LDA and KL divergence to analysis the influence and relevance from a topic modeling perspective. Then two topic-aware heuristics based on betweenness and out-degree for finding approximate solutions to this problem are proposed. Using two real networks, we demonstrate experimentally the high performance of the proposed models and learning schemes.

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

    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. Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the WWW 2011, pp. 665–674. ACM (2011)

    Google Scholar 

  4. 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 

  5. Wang, S., Zhao, X., Chen, Y., Li, Z., Zhang, K., Xia, J.: Negative influence minimizing by blocking nodes in social networks. In: AAAI (Late-Breaking Developments) (2013)

    Google Scholar 

  6. 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 (2003)

    Google Scholar 

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

    Google Scholar 

  8. Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM 2010 (2010)

    Google Scholar 

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

    Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 99, 1–18 (2010)

    Google Scholar 

  12. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD 2007 (2007)

    Google Scholar 

  13. Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW 2011 (2011)

    Google Scholar 

  14. Zhou, C., Zhang, P., Guo, J., Zhu, X., Guo, L.: Ublf: an upper bound based approach to discover influential nodes in social networks. In: IEEE 13th International Conference on Data Mining (ICDM), pp. 907–916. IEEE (2013)

    Google Scholar 

  15. Zhou, C., Zhang, P., Guo, J., Guo, L.: An upper bound based greedy algorithm for mining top-k influential nodes in social networks. In: 23rd International World Wide Web Conference (WWW), pp. 421–422. ACM (2014)

    Google Scholar 

  16. Zhou, C., Zhang, P., Zang, W., Guo, L.: On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans. Knowl. Data Eng

    Google Scholar 

  17. Guo, J., Zhang, P., Zhou, C., Cao, Y., Guo, L.: Item-based top-k influential user discovery in social networks. In: IEEE 13th International Conference on Data Mining Workshops (ICDMW), pp. 780–787. IEEE (2013)

    Google Scholar 

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

  19. Goyal, A., Bonchi, F., Lakshmanan, L.V.: A data-based approach to social influence maximization. Proc. VLDB Endowment 5(1), 73–84 (2011)

    Article  Google Scholar 

  20. Zhou, C., Zhang, P., Zang, W., Guo, L.: Maximizing the long-term integral influence in social networks under the voter model. In: 23rd International World Wide Web Conference (WWW), pp. 423–424. ACM (2014)

    Google Scholar 

  21. Zhou, C., Zhang, P., Zang, W., Guo, L.: Maximizing the cumulative influence through a social network when repeat activation exists. In: ICCS 2014 (2014)

    Google Scholar 

  22. Zhou, C., Guo, L.: A note on influence maximization in social networks from local to global and beyond. Procedia Comput. Sci. 30, 81–87 (2014)

    Article  Google Scholar 

  23. Zang, W., Zhang, P., Zhou, C., Guo, L.: Discovering multiple diffusion source nodes in social networks. Procedia Comput. Sci. 29, 443–452 (2014)

    Article  Google Scholar 

  24. Zang, W., Wang, P., Zhou, C., Guo, L.: Topic-aware source locating in social networks. In: 24th International World Wide Web Conference. ACM (2015)

    Google Scholar 

  25. Yao, Q., Zhou, C., Xiang, L., Cao, Y., Guo, L.: Minimizing the negative influence by blocking links in social networks. In: 2014 International Standard Conference on Trustworthy Computing and Services (2014)

    Google Scholar 

  26. Yao, Q., Zhou, C., Shi, R., Wang, P., Guo, L.: Topic-aware social influence minimization. In: 24th International World Wide Web Conference. ACM (2015)

    Google Scholar 

  27. Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)

    Article  Google Scholar 

  28. Newman, M.E., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66(3), 035101 (2002)

    Article  Google Scholar 

  29. Habiba, Yu, Y., Berger-Wolf, T.Y., Saia, J.: Finding spread blockers in dynamic networks. In: Giles, L., Smith, M., Yen, J., Zhang, H. (eds.) SNAKDD 2008. LNCS, vol. 5498, pp. 55–76. Springer, Heidelberg (2010)

    Google Scholar 

  30. Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. In: Proceedings of the ICDM 2012, pp. 81–90. IEEE Computer Society (2012)

    Google Scholar 

  31. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)

    MATH  Google Scholar 

  32. Dumais, S.T.: Latent semantic analysis. Ann. Rev. Inf. Sci. Technol. 38(1), 188–230 (2004)

    Article  Google Scholar 

  33. Casella, G., George, E.I.: Explaining the gibbs sampler. Am. Stat. 46(3), 167–174 (1992)

    MathSciNet  Google Scholar 

  34. Antoniak, C.E.: Mixtures of dirichlet processes with applications to bayesian nonparametric problems. Ann. Stat. 2, 1152–1174 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  35. Zhang, P., Zhou, C., Wang, P., Gao, B.J., Zhu, X., Guo, L.: E-tree: an efficient indexing structure for ensemble models on data streams. IEEE Trans. Knowl. Data Eng. 27(2), 461–474 (2015)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the 973 project (No. 2013CB 329606), and the Strategic Leading Science and Technology Projects of Chinese Academy of Sciences (No. XDA06030200), Australia ARC Discovery Project (DP1402206).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qipeng Yao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yao, Q., Guo, L. (2015). Minimizing the Social Influence from a Topic Modeling Perspective. In: Zhang, C., et al. Data Science. ICDS 2015. Lecture Notes in Computer Science(), vol 9208. Springer, Cham. https://doi.org/10.1007/978-3-319-24474-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24474-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24473-0

  • Online ISBN: 978-3-319-24474-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics