Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017 (2017), Article ID 5049836, 14 pages
https://doi.org/10.1155/2017/5049836
Research Article

On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks

School of Computer, National University of Defense Technology, Changsha 410073, China

Correspondence should be addressed to Xiaodong Liu; nc.ude.tdun@gnodoaixuil

Received 13 March 2017; Revised 4 July 2017; Accepted 1 August 2017; Published 28 September 2017

Academic Editor: Piotr Brodka

Copyright © 2017 Xiaodong Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Domingos and M. Richardson, “Mining the network value of customers,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '01), pp. 57–66, ACM Press, San Francisco, Calif, USA, August 2001. View at Scopus
  2. Twitter 2012 Facts and Figures, 2012, http://www.website-monitoring.com/blog/2012/11/07/.
  3. W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 199–208, ACM, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. C. Wang, W. Chen, and Y. Wang, “Scalable influence maximization for independent cascade model in large-scale social networks,” Data Mining and Knowledge Discovery, vol. 25, no. 3, pp. 545–576, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Vanbriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pp. 420–429, New York, NY, USA, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. X. Liu, S. Li, X. Liao, L. Wang, and Q. Wu, “In-Time Estimation for Influence Maximization in Large-Scale Social Networks,” in Proceedings of the ACM EuroSys Workshop on Social Network Systems, pp. 1–6, Bern, Switzerland, 2012.
  7. A.-L. Barabasi and R. Albert, “Emergence of scaling in random networks,” American Association for the Advancement of Science. Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  8. X. Liu, X. Liao, S. Li, and B. Lin, “Towards efficient influence maximization for evolving social networks,” in Proceedings of the 18th Asia Pacific Web Conference, pp. 232–244, 2016.
  9. Y. Tang, Y. Shi, and X. Xiao, “Influence maximization in near-linear time: a martingale approach,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, (SIGMOD '15), pp. 1539–1554, Melbourne, Australia, June 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Wang, G. Cong, G. Song, and K. Xie, “Community-based Greedy algorithm for mining top-K influential nodes in mobile social networks,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '10), pp. 1039–1048, ACM, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Goyal, W. Lu, and L. V. S. Lakshmanan, “CELF++: optimizing the greedy algorithm for influence maximization in social networks,” in Proceedings of the 20th International Conference Companion on World Wide Web, (WWW '11), pp. 47-48, Hyderabad, India, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. K. Jung, W. Heo, and W. Chen, “IRIE: A Scalable Influence Maximization Algorithm for Independent Cascade Model and Its Extensions,” https://arxiv.org/abs/1111.4795.
  13. X. Liu, M. Li, S. Li, S. Peng, X. Liao, and X. Lu, “IMGPU: GPU-accelerated influence maximization in large-scale social networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 136–145, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. Y.-C. Chen, W.-Y. Zhu, W.-C. Peng, W.-C. Lee, and S.-Y. Lee, “CIM: community-based influence maximization in social networks,” ACM Transactions on Intelligent Systems and Technology, vol. 5, no. 2, article no. 25, 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. X.-G. Wang, “An algorithm for critical nodes problem in social networks based on owen value,” The Scientific World Journal, vol. 2014, Article ID 414717, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. Z. Lu, W. Zhang, W. Wu, J. Kim, and B. Fu, “The complexity of influence maximization problem in the deterministic linear threshold model,” Journal of Combinatorial Optimization, vol. 24, no. 3, pp. 374–378, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. Z. Lu, L. Fan, W. Wu, B. Thuraisingham, and K. Yang, “Efficient influence spread estimation for influence maximization under the linear threshold model,” Computational Social Networks, vol. 1, no. 1, 2014. View at Google Scholar
  18. H. Nguyen and R. Zheng, “On budgeted influence maximization in social networks,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 6, pp. 1084–1094, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Han, M. Yan, Z. Cai, and Y. Li, “An exploration of broader influence maximization in timeliness networks with opportunistic selection,” Journal of Network and Computer Applications, vol. 63, pp. 39–49, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. B. Liu, G. Cong, Y. Zeng, D. Xu, and Y. M. Chee, “Influence spreading path and its application to the time constrained social influence maximization problem and beyond,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 8, pp. 1904–1917, 2014. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Pei, X. Teng, J. Shaman, F. Morone, and H. A. Makse, “Efficient collective influence maximization in cascading processes with first-order transitions,” Scientific Reports, vol. 7, Article ID 45240, 2017. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Y. Habiba, T. Y. Berger-Wolf, and J. Saia, “Finding Spread Blockers in Dynamic Networks,” in Advances in Social Network Mining and Analysis, vol. 5498 of Lecture Notes in Computer Science, pp. 55–76, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  23. R. Michalski, T. Kajdanowicz, P. Bródka, and P. Kazienko, “Seed selection for spread of influence in social networks: Temporal vs. static approach,” New Generation Computing, vol. 32, no. 3-4, pp. 213–235, 2014. View at Publisher · View at Google Scholar · View at Scopus
  24. W. Chen, W. Lu, and N. Zhang, “Time-critical influence maximization in social networks with time-delayed diffusion process,” in Proceedings of the Proceedings of the 26th Conference on Artificial Intelligence, Toronto, Canada, 2012.
  25. M. Gomez-Rodriguez and B. Scholkopf, “Influence Maximization in Continuous Time Diffusion Networks,” in Proceedings of the 29th International Conference on Machine Learning, Scotland, UK, 2012.
  26. C. Aggarwal, S. Lin, and P. S. Yu, “On influential node discovery in dynamic social networks,” in Proceedings of the 12th SIAM International Conference on Data Mining, (SDM '12), pp. 636–647, SIAM, Calif, USA, April 2012. View at Scopus
  27. H. Zhuang, Y. Sun, J. Tang, J. Zhang, and X. Sun, “Influence maximization in dynamic social networks,” in Proceedings of the 13th IEEE International Conference on Data Mining, ICDM 2013, pp. 1313–1318, Dallas, Tex, USA, December 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. G. Tong, W. Wu, S. Tang, and D.-Z. Du, “Adaptive Influence Maximization in Dynamic Social Networks,” IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 112–125, 2017. View at Publisher · View at Google Scholar · View at Scopus
  29. D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146, Washington, DC, USA, 2003. View at MathSciNet
  30. M. Richardson and P. Domingos, “Mining knowledge-sharing sites for viral marketing,” in Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '02), pp. 61–70, ACM, Edmonton, Canada, July 2002. View at Publisher · View at Google Scholar · View at Scopus
  31. Y.-C. Chen, W.-C. Peng, and S.-Y. Lee, “Efficient algorithms for influence maximization in social networks,” Knowledge and Information Systems, vol. 33, no. 3, pp. 577–601, 2012. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Heidari, M. Asadpour, and H. Faili, “SMG: fast scalable greedy algorithm for influence maximization in social networks,” Physica A: Statistical Mechanics and its Applications, vol. 420, pp. 124–133, 2015. View at Publisher · View at Google Scholar · View at Scopus
  33. F. Morone and H. A. Makse, “Influence maximization in complex networks through optimal percolation,” Nature, vol. 524, no. 7563, pp. 65–68, 2015. View at Publisher · View at Google Scholar · View at Scopus
  34. G. Song, X. Zhou, Y. Wang, and K. Xie, “Influence maximization on large-scale mobile social network: a divide-and-conquer method,” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 5, pp. 1379–1392, 2015. View at Publisher · View at Google Scholar
  35. C. Zhou, P. Zhang, W. Zang, and L. Guo, “On the upper bounds of spread for greedy algorithms in social network influence maximization,” IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 10, pp. 2770–2783, 2015. View at Publisher · View at Google Scholar · View at Scopus
  36. A. Capocci, V. D. P. Servedio, F. Colaiori et al., “Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia,” Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, vol. 74, no. 3, Article ID 036116, 2006. View at Publisher · View at Google Scholar · View at Scopus
  37. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins, “Microscopic evolution of social networks,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, pp. 462–470, Las Vegas, Nev, USA, August 2008. View at Publisher · View at Google Scholar · View at Scopus
  38. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World, Cambridge University Press, Cambridge, Mass, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  39. V. P. CORONA, “Memory, Monsters, and Lady Gaga,” The Journal of Popular Culture, vol. 46, no. 4, pp. 725–744, 2013. View at Publisher · View at Google Scholar
  40. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, “On the evolution of user interaction in Facebook,” in Proceedings of the 2nd ACM SIGCOMM Workshop on Online Social Networks, pp. 37–42, Barcelona, Spain, August 2009. View at Publisher · View at Google Scholar
  41. “ArXiv NetHEPT dataset,” http://www.cs.cornell.edu/projects/kddcup/datasets.html.
  42. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, “Growth of the flickr social network,” in Proceedings of the 1st ACM SIGCOMM Workshop on Social Networks (WOSN '08), pp. 25–30, ACM, August 2008. View at Publisher · View at Google Scholar · View at Scopus
  43. J. Tang, J. Sun, C. Wang, and Z. Yang, “Social influence analysis in large-scale networks,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pp. 807–815, Paris, France, July 2009. View at Publisher · View at Google Scholar · View at Scopus