Maximizing product adoption in social networks
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326 · cited 17×
“We show that the problem of product adoption maximization is NP-hard but the objective function, i.e., the expected number of product adoptions, is monotone and submodular; thus the greedy algorithm provides a (1 - 1/e -”
BackgroundMethodInfluentialMining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830 · cited 1×
“[6] introduced the the problem of identifying influential users to the data mining community.”
BackgroundCost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
A matrix factorization technique with trust propagation for recommendation in social networks
Jamali, M., & Ester, M. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864736 · Cited by 1,632 · cited 1×
“[11], in its raw form has 1M users, 14M (undirected) friendship relations among users, and 8.”
BackgroundDistinguishing influence-based contagion from homophily-driven diffusion in dynamic networks
Aral, S., Muchnik, L., & Sundararajan, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0908800106 · Cited by 1,207 · cited 1×
“, [1]) focus on distinguishing the effects of influence and homophily, others (e.”
BackgroundLearning influence probabilities in social networks
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718518 · Cited by 1,022 · cited 2×
“As in [7], we learn influence weights from the past behavior of users.”
BackgroundSelf-citationSocial influence analysis in large-scale networks
Tang, J., Sun, J., Wang, C., & Yang, Z. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557108 · Cited by 927 · cited 1×
“[18] recognize that influence varies with the domain/topic of an item.”
BackgroundScalable Influence Maximization in Social Networks under the Linear Threshold Model
Chen, W., Yuan, Y., & Zhang, L. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.118 · Cited by 924 · cited 2×
“Furthermore, since the LT model is a special case of the LT-C model (corresponding to λv = 1, ∀v and rv,i = rmax, ∀v), the #Phardness [4] of computing the spread of a given seed set carries over to our setting.”
MethodAdvances in Collaborative Filtering
Koren, Y., & Bell, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_5 · Cited by 745 · cited 4×
“Matrix factorization [14] is one such popular method.”
MethodInfluentialFeedback effects between similarity and social influence in online communities
Crandall, D., Cosley, D., Huttenlocher, D., Kleinberg, J., & Suri, S. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401914 · Cited by 603 · cited 2×
“[5] argued that both influence and homophily can be useful in predicting users’ future behavior.”
Background
Cited by
Information and Influence Propagation in Social Networks
Chen, W., Lakshmanan, L. V. S., & Castillo, C. (2013) · Synthesis lectures on data management · doi:10.2200/s00527ed1v01y201308dtm037 · Cited by 254
Self-citation
Metadata
- Authors
- Bhagat, S., Goyal, A., & Lakshmanan, L. V. S.
- Venue
- Proceedings of the fifth ACM international conference on Web search and data mining
- Publisher
- ACM
- Published
- 2012-02-08
- Pages
- 603-612
- OpenAlex
- W2102920490
- Cited by
- 169
- References
- 18
- FWCI
- 17.31
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.