Influence Maximization Problem for Unknown Social Networks

ABSTRACT

We propose a novel problem called influence maximization for unknown graphs, and propose a heuristic algorithm for the problem. Influence maximization is the problem of detecting a set of influential nodes in a social network, which represents social relationships among individuals. Influence maximization has been actively studied, and several algorithms have been proposed in the literature. The existing algorithms use the entire topological structure of a social network. In practice, however, complete knowledge of the topological structure of a social network is typically difficult to obtain. We therefore tackle an influence maximization problem for unknown graphs. As a solution for this problem, we propose a heuristic algorithm, which we call IMUG (Influence Maximization for Unknown Graphs). Through extensive simulations, we show that the proposed algorithm achieves 60--90% of the influence spread of the algorithms using the entire social network topology, even when only 1--10% of the social network topology is known. These results indicate that we can achieve a reasonable influence spread even when knowledge of the social network topology is severely limited.

References

1. P. Gupta, A. Goel, J. Lin, A. Sharma, D. Wang, and R. Zadeh, "WTF: The who to follow service at Twitter," in Proceedings of the International Conference on the World Wide Web (WWW'13), May 2013, pp. 505--514.
2. "Facebook Reports First Quarter 2014 Results," http://investor.fb.com/releasedetail.cfm?ReleaseID=842071.
3. E. Bakshy, J. M. Hofman, W. A. Mason, and D. J. Watts, "Everyone's an influencer: Quantifying influence on Twitter," in Proceedings of the 4th ACM International Conference on Web Search and Data Mining (WSDM'11), Feb. 2011, pp. 65--74.
4. D. Kempe, J. M. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03), Aug. 2003, pp. 137--146.
5. 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), Jun. 2009, pp. 199--208.
6. 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), Aug. 2001, pp. 57--66.
7. 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), 2002, pp. 61--70.
8. Y. Tang, X. Xiao, and Y. Shi, "Influence maximization: Near-optimal time complexity meets practical efficiency," in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD'14), Jun. 2014, pp. 75--86.
9. A. Goyal, W. Lu, and L. V. 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), Mar. 2011, pp. 47--48.
10. N. Ohsaka, T. Akiba, Y. Yoshida, and K. Kawarabayashi, "Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations," in Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI'14), Jul. 2014, pp. 138--144.
11. E. Cohen, D. Delling, T. Pajor, and R. F. Werneck, "Sketch-based influence maximization and computation: Scaling up with guarantees," in Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM'14), Jul. 2014, pp. 629--638.
12. W. Chen, C. Wang, and Y. Wang, "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 (KDD'10), Jul. 2010.
13. K. Jung, W. Heo, and W. Chen, "IRIE: Scalable and robust influence maximization in social networks," in Proceedings of the 12th IEEE International Conference on Data Mining (ICDM'12), Dec. 2012, pp. 918--923.
14. 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 '13), Dec. 2013, pp. 1313--1318.
15. A. S. Maiya and T. Y. Berger-Wolf, "Benefits of bias: Towards better characterization of network sampling," in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'11), Sep. 2011, pp. 105--113.
16. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Walking in Facebook: A case study of unbiased sampling of OSNs," in Proceedings of the 29th IEEE International Conference on Computer Communication (INFOCOM'10), Mar. 2010, pp. 1--9.
17. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan, "On minimizing budget and time in influence propagation over social networks," Social Network Analysis and Mining, vol. 3, no. 2, pp. 179--192, Jun. 2013.
18. S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks," in Proceedings of the 3rd international Workshop on Internet and Network Economics (WINE'07), Dec. 2007, pp. 306--311.
19. F. Tang, Q. Liu, H. Zhu, E. Chen, and F. Zhu, "Diversified social influence maximization," in Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM'14), Aug. 2014, pp. 455--459.
20. W. Chen, W. Lu, and N. Zhang, "Time-critical influence maximization in social networks with time-delayed diffusion process," in Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI'12), Jul. 2012, pp. 592--598.
21. C. Zhang, J. Sun, and K. Wang, "Information propagation in microblog networks," in Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM'13), Aug. 2013, pp. 190--196.
22. P. Erdös and A. Rényi, "On the evolution of random graphs," in Publications of the Mathematical Institute of Hungarian Academy of Sciences, vol. 5, 1960, pp. 17--61.
23. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509--512, Oct. 1999.
24. J. Yang and J. Leskovec, "Defining and evaluating network communities based on ground-truth," in Proceedings of the 12th IEEE International Conference on Data Mining (ICDM'12), Dec. 2012, pp. 745--754.
25. J. Leskovec, L. A. Adamic, and B. A. Huberman, "The dynamics of viral marketing," ACM Transactions on the Web (TWEB), vol. 1, no. 1, pp. 5:1--5:39, May 2007.
26. J. Leskovec and J. J. Mcauley, "Learning to discover social circles in ego networks," in Proceedings of the Neural Information Processing Systems (NIPS'12), Dec. 2012, pp. 539--547.
27. 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 Social Networks (WOSN'09), Aug. 2009, pp. 37--42.
28. 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, Jan. 2014.
29. H. Lamba and R. Narayanam, "A novel and model independent approach for efficient influence maximization in social networks," in Proceedings of the 14th International Conference on Web Information Systems Engineering (WISE'13), Oct. 2013, pp. 73--87.
30. Z. Huiyuan, T. N. Dinh, and M. T. Thai, "Maximizing the spread of positive influence in online social networks," in Proceedings of the 33rd IEEE International Conference on Distributed Computing Systems (ICDCS'13), Jul. 2013, pp. 317--326.
31. Q. Liu, B. Xiang, E. Chen, H. Xiong, F. Tang, and Y. X. Jeffrey, "Influence maximization over large-scale social networks: A bounded linear approach," in Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM'14), Nov. 2014, pp. 171--180.
32. M. E. Newman, "Assortative mixing in networks," Physical Review Letters, vol. 89, no. 20, pp. 208 701:1--208 701:4, Nov. 2002.
33. J.-P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, D. Lazer, K. Kaski, J. Kertész, and A.-L. Barabási, "Structure and tie strengths in mobile communication networks," Proceedings of the National Academy of Sciences, vol. 104, no. 18, pp. 7332--7336, May 2007.
34. D. J. Watts and S. H. Strogatz, "Collective dynamics of • •small-world • •networks," Nature, vol. 393, no. 6684, pp. 440--442, Jun. 1998.

Index Terms

• Human-centered computing

  • Human computer interaction (HCI)

    • Interaction paradigms

      • Web-based interaction

• Information systems

  • Information systems applications

    • Data mining