skip to main content
10.1145/2124295.2124368acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Maximizing product adoption in social networks

Published:08 February 2012Publication History

ABSTRACT

One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network leading to a large number of adoptions in an expected sense. The seminal work of Kempe et al. [13] approaches this as the problem of influence maximization. This and other previous papers tacitly assume that a user who is influenced (or, informed) about a product necessarily adopts the product and encourages her friends to adopt it. However, an influenced user may not adopt the product herself, and yet form an opinion based on the experiences of her friends, and share this opinion with others. Furthermore, a user who adopts the product may not like the product and hence not encourage her friends to adopt it to the same extent as another user who adopted and liked the product. This is independent of the extent to which those friends are influenced by her. Previous works do not account for these phenomena.

We argue that it is important to distinguish product adoption from influence. We propose a model that factors in a user's experience (or projected experience) with a product. We adapt the classical Linear Threshold (LT) propagation model by defining an objective function that explicitly captures product adoption, as opposed to influence. We show that under our model, adoption maximization is NP-hard and the objective function is monotone and submodular, thus admitting an approximation algorithm. We perform experiments on three real popular social networks and show that our model is able to distinguish between influence and adoption, and predict product adoption much more accurately than approaches based on the classical LT model.

References

  1. S. Aral, L. Muchnik, and A. Sundararajan. Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. In PNAS, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. M. Bohlen and G. M. Beal. The diffusion process. Spl. Report No. 18, Agri. Extn. Serv., Iowa State College, 1957.Google ScholarGoogle Scholar
  3. 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, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  4. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Crandall, D. Cosley, D. Huttenlocher, J. Kleinberg, and S. Suri. Feedback effects between similarity and social inuence in online communities. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Domingos and M. Richardson. Mining the network value of customers. In KDD, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social influence maximization. PVLDB, 5(1), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Goyal, W. Lu, and L. V. S. Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Hartline, V. Mirrokni, and M. Sundararajan. Optimal marketing strategies over social networks. In WWW, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Jamali and M. Ester. A matrix factorization technique with trust propagation for recommendation in social networks. In RecSys, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Kalish. A new product adoption model with price, advertising, and uncertainty. Management Science, 31(12), 1985.Google ScholarGoogle Scholar
  13. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Koren and R. Bell. Advances in collaborative filtering. In Recommender Systems Handbook. 2011.Google ScholarGoogle ScholarCross RefCross Ref
  15. T. La Fond and J. Neville. Randomization tests for distinguishing social influence and homophily effects. In WWW, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. M. Romero, W. Galuba, S. Asur, and B. A. Huberman. Influence and passivity in social media. In WWW, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Tang, J. Sun, C. Wang, and Z. Yang. Social influence analysis in large-scale networks. In KDD, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Maximizing product adoption in social networks

    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
      WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
      February 2012
      792 pages
      ISBN:9781450307475
      DOI:10.1145/2124295

      Copyright © 2012 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: 8 February 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate498of2,863submissions,17%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader