The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Mining the network value of customers
Abstract
One of the major applications of data mining is in helping companies determine which potential customers to market to. If the expected profit from a customer is greater than the cost of marketing to her, the marketing action for that customer is executed. So far, work in this area has considered only the intrinsic value of the customer (i.e, the expected profit from sales to her). We propose to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively. Instead of viewing a market as a set of independent entities, we view it as a social network and model it as a Markov random field. We show the advantages of this approach using a social network mined from a collaborative filtering database. Marketing that exploits the network value of customers---also known as viral marketing---can be extremely effective, but is still a black art. Our work can be viewed as a step towards providing a more solid foundation for it, taking advantage of the availability of large relevant databases.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
Information Rules: A Strategic Guide to the Network Economy
Shaw, M. J., Shapiro, C., & Varian, H. R. (2000) · The Academy of Management Review · doi:10.2307/259025 · Cited by 4,124
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Self-citationInformation Rules: A Strategic Guide to the Network Economy
Becker, W. E., Shapiro, C., & Varian, H. R. (1999) · The Journal of Economic Education · doi:10.2307/1183273 · Cited by 2,557
An Algorithmic Framework for Performing Collaborative Filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130372 · Cited by 2,512
An algorithmic framework for performing collaborative filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312682 · Cited by 2,011
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-L., Albert, R., & Jeong, H. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,408
Markov Random Fields and Their Applications
Kindermann, R., & Snell, J. L. (1980) · Contemporary Mathematics · doi:10.1090/conm/001 · Cited by 1,290
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
Referral Web: combining social networks and collaborative filtering
Kautz, H., Selman, B., & Shah, M. (1997) · Communications of the ACM · doi:10.1145/245108.245123 · Cited by 847
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
Data mining for direct marketing: problems and solutions
Ling, C. X., & Cheng-hui, L. (1998) · Cited by 661
PHOAKS: a system for sharing recommendations
Terveen, L., Hill, W., Amento, B., McDonald, D., & Creter, J. (1997) · Communications of the ACM · doi:10.1145/245108.245122 · Cited by 493
Estimating probabilities: a crucial task in machine learning
Cestnik, B. (1990) · European Conference on Artificial Intelligence · Cited by 459
Cook, D. J., & Holder, L. B. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.850825 · Cited by 406
Scalable Techniques for Mining Causal Structures
Silverstein, C., Brin, S., Motwani, R., & Ullman, J. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009891813863 · Cited by 319
Iterative Classification in Relational Data
Neville, J., & Jensen, D. D. (2000) · Cited by 318
Markov random fields : theory and application
Chellappa, R., & Jain, A. K. (1993) · Academic Press eBooks · Cited by 265
Rucker, J., & Polanco, M. J. (1997) · Communications of the ACM · doi:10.1145/245108.245125 · Cited by 257
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining
Agrawal, R., & Stolorz, P. (1998) · Knowledge Discovery and Data Mining · Cited by 252
Extracting Large-Scale Knowledge Bases from the Web
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Cited by 239
Iacobucci, D. (1996) · Sage eBooks · doi:10.4135/9781483327723 · Cited by 236
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244301753344614 · Cited by 219
Discovering shared interests using graph analysis
Schwartz, M. F., & Wood, D. C. M. (1993) · Communications of the ACM · doi:10.1145/163381.163402 · Cited by 218
Dye, R. (2000) · PubMed · Cited by 195
Cooper, G. F. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009787925236 · Cited by 166
Estimating campaign benefits and modeling lift
Piatetsky-Shapiro, G., & Masand, B. M. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312225 · Cited by 74
Cobot in LambdaMOO: A Social Statistics Agent
Isbell, C. L., Kearns, M. J., Kormann, D., Singh, S. P., & Stone, P. (2000) · Cited by 65
Statistics and data mining techniques for lifetime value modeling
Mani, D. R., Drew, J. H., Betz, A. L., & Datta, P. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312205 · Cited by 60
A Decision Theoretic Approach to Targeted AdvertisingPreprint
Chickering, D. M., & Heckerman, D. E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3842 · Cited by 50
Hughes, A. M. (1995) · Cited by 33
Cited by
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
Evaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Measuring user influence in twitter: The million follower fallacy
Cha, M., Haddadi, H., Benevenuto, F., & Gummadi, K. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14033 · Cited by 3,022
“Instead, it posits that the key factors determining influence are (i) the interpersonal relationship among ordinary users and (ii) the readiness of a society to adopt an innovation (Watts and Dodds 2007; Domingos and Richardson 2001).”
BackgroundEfficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
Metadata
- Authors
- Domingos, P., & Richardson, M.
- Venue
- Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2001-08-26
- Pages
- 57-66
- OpenAlex
- W2042123098
- Cited by
- 2,830
- References
- 41
- FWCI
- 112.43
- 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.