ABSTRACT
Often in marketing, political campaigns and social media, two competing products or opinions propagate over a social network. Studying social influence in such competing cascades scenarios enables building effective strategies for maximizing the propagation of one process by targeting the most "influential" nodes in the network. The majority of prior work however, focuses on unsigned networks where individuals adopt the opinion of their neighbors with certain probability. In real life, relationships between individuals can be positive (e.g., friend of relationship) or negative (e.g. connection between "foes"). According to social theory, people tend to have similar opinions to their friends but opposite of their foes. In this work, we study the problem of competing cascades on signed networks, which has been relatively unexplored. Particularly, we study the progressive propagation of two competing cascades in a signed network under the Independent Cascade Model, and provide an approximate analytical solution to compute the probability of infection of a node at any given time. We leverage our analytical solution to the problem of competing cascades in signed networks to develop a heuristic for the influence maximization problem. Unlike prior work, we allow the seed-set to be initialized with populations of both cascades with the end goal of maximizing the spread of one cascade. We validate our approach on several large-scale real-world and synthetic networks. Our experiments demonstrate that our influence maximization heuristic significantly outperforms state-of-the-art methods, particularly when the network is dominated by distrust relationships.
- C. Chelmis and V. K. Prasanna, "The role of organization hierarchy in technology adoption at the workplace," in Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. ACM, 2013, pp. 8--15. Google ScholarDigital Library
- A. Srivastava, C. Chelmis, and V. K. Prasanna, "Influence in social networks: A unified model?" in Advances in Social Networks Analysis and Mining (ASONAM), 2014 IEEE/ACM International Conference on. IEEE, 2014, pp. 451--454.Google Scholar
- D. Kempe, J. Kleinberg, and É. 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. ACM, 2003, pp. 137--146. Google ScholarDigital Library
- C. Budak, D. Agrawal, and A. El Abbadi, "Diffusion of information in social networks: Is it all local?" in ICDM, 2012, pp. 121--130. Google ScholarDigital Library
- C. Chelmis, A. Srivastava, and V. K. Prasanna, "Computational models of technology adoption at the workplace," Social Network Analysis and Mining, vol. 4, no. 1, pp. 1--18, 2014.Google ScholarCross Ref
- J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Signed networks in social media," in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. ACM, 2010, pp. 1361--1370. Google ScholarDigital Library
- Y. Li, W. Chen, Y. Wang, and Z.-L. Zhang, "Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships," in Proceedings of the sixth ACM international conference on Web search and data mining. ACM, 2013, pp. 657--666. Google ScholarDigital Library
- D. Li, Z.-M. Xu, N. Chakraborty, A. Gupta, K. Sycara, and S. Li, "Polarity related influence maximization in signed social networks," PloS one, vol. 9, no. 7, p. e102199, 2014.Google ScholarCross Ref
- S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks," in Internet and Network Economics. Springer, 2007, pp. 306--311. Google ScholarDigital Library
- A. Borodin, Y. Filmus, and J. Oren, "Threshold models for competitive influence in social networks," in Internet and network economics. Springer, 2010, pp. 539--550. Google ScholarDigital Library
- X. He, G. Song, W. Chen, and Q. Jiang, "Influence blocking maximization in social networks under the competitive linear threshold model." in SDM. SIAM, 2012, pp. 463--474.Google Scholar
- P. Domingos and M. Richardson, "Mining the network value of customers," in Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2001, pp. 57--66. Google ScholarDigital Library
- W. Chen, W. Lu, and N. Zhang, "Time-critical influence maximization in social networks with time-delayed diffusion process," arXiv preprint arXiv:1204.3074, 2012.Google Scholar
- 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. ACM, 2010, pp. 1029--1038. Google ScholarDigital Library
- 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. ACM, 2009, pp. 199--208. Google ScholarDigital Library
- A. Goyal, W. Lu, and L. V. Lakshmanan, "Simpath: An efficient algorithm for influence maximization under the linear threshold model," in Data Mining (ICDM), 2011 IEEE 11th International Conference on. IEEE, 2011, pp. 211--220. Google ScholarDigital Library
- W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincon, X. Sun, Y. Wang, W. Wei, and Y. Yuan, "Influence maximization in social networks when negative opinions may emerge and propagate." in SDM, vol. 11. SIAM, 2011, pp. 379--390.Google Scholar
- D. Easley and J. Kleinberg, Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2010. Google ScholarCross Ref
- N. Pathak, A. Banerjee, and J. Srivastava, "A generalized linear threshold model for multiple cascades," in Data Mining (ICDM), 2010 IEEE 10th International Conference on. IEEE, 2010, pp. 965--970. Google ScholarDigital Library
- S. A. Myers and J. Leskovec, "Clash of the contagions: Cooperation and competition in information diffusion." in ICDM, vol. 12. Citeseer, 2012, pp. 539--548. Google ScholarDigital Library
Social Influence Computation and Maximization in Signed Networks with Competing Cascades
Recommendations
Influence Maximization in Online Social Networks
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data MiningStarting with the earliest studies showing that the spread of new trends, information, and innovations is closely related to the social influence exerted on people by their social networks, the research on social influence theory took off, providing ...
Predicting event attendance exploring social influence
SAC '19: Proceedings of the 34th ACM/SIGAPP Symposium on Applied ComputingThe problem of predicting people's participation in real-world events has received considerable attention as it offers valuable insights for human behavior analysis and event-related advertisement. Today social networks (e.g. Twitter) widely reflect ...
Influence and correlation in social networks
KDD '08: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data miningIn many online social systems, social ties between users play an important role in dictating their behavior. One of the ways this can happen is through social influence, the phenomenon that the actions of a user can induce his/her friends to behave in a ...
Comments