skip to main content
10.1145/2808797.2809304acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Social Influence Computation and Maximization in Signed Networks with Competing Cascades

Authors Info & Claims
Published:25 August 2015Publication History

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle Scholar
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarCross RefCross Ref
  9. S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks," in Internet and Network Economics. Springer, 2007, pp. 306--311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle Scholar
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle Scholar
  18. D. Easley and J. Kleinberg, Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2010. Google ScholarGoogle ScholarCross RefCross Ref
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  1. Social Influence Computation and Maximization in Signed Networks with Competing Cascades

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015
        August 2015
        835 pages
        ISBN:9781450338547
        DOI:10.1145/2808797

        Copyright © 2015 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 25 August 2015

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        Acceptance Rates

        Overall Acceptance Rate116of549submissions,21%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader