ACM Home Page
Please provide us with feedback. Feedback
Mining the network value of customers
Full text PdfPdf (999 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Francisco, California
Pages: 57 - 66  
Year of Publication: 2001
ISBN:1-58113-391-X
Authors
Pedro Domingos  University of Washington, Seattle, WA
Matt Richardson  University of Washington, Seattle, WA
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
AAAI : American Association for Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 57,   Downloads (12 Months): 375,   Citation Count: 73
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502512.502525
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. L. Barabasi, R. Albert, and H. Jong. Scale-free characteristics of random networks: The topology of the World Wide Web. Physica A, 281:69-77, 2000.
 
2
J. Besag. Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B, 36:192-236, 1974.
 
3
J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Madison, WI, 1998. Morgan Kaufmann.
 
4
 
5
B. Cestnik. Estimating probabilities: A crucial task in machine learning. In Proceedings of the Ninth European Conference on Artificial Intelligence, pages 147-149, Stockholm, Sweden, 1990. Pitman.
6
 
7
R. Chellappa and A. K. Jain, editors. Markov Random Fields: Theory and Application. Academic Press, Boston, MA, 1993.
 
8
 
9
 
10
 
11
 
12
It. Dye. The buzz on buzz. Harvard Business Review, 78(6):139-146, 2000.
13
 
14
 
15
 
16
S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741, 1984.
 
17
18
 
19
A. M. Hughes. The Complete Database Marketer: Second.Generation Strategies and Techniques for Tapping the Power of your Customer Database. Irwin, Chicago, IL, 1996.
 
20
D. Iacobucci, editor. Networks in Marketing. Sage, Thousand Oaks, CA, 1996.
 
21
 
22
D. It. Jackson. Strategic application of customer lifetime value in direct marketing. Journal of Targeting, Measurement and Analysis for Marketing, 1:9-17, 1994.
 
23
S. Jurvetson. What exactly is viral marketing? Red Herring, 78:110-112, 2000.
24
 
25
R. Kindermman and J. L. Snell. Markov Random Fields and Their Applications. American Mathematical Society, Providence, RI, 1980.
 
26
 
27
D. Krackhardt. Structural leverage in marketing. In D. Iacobueci, editor, Networks in Marketing, pages 50-59. Sage, Thousand Oaks, CA, 1996.
 
28
 
29
C. X. Ling and C. Li. Data mining for direct marketing: Problems and solutions. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 73-79, New York, NY, 1998. AAAI Press.
30
 
31
S. Milgra.m. The small world problem. Psychology Today, 2:60-67, 1967.
 
32
J. Neville and D. Jensen. Iterative classification in relational data. In Proceedings of the AAAI-2000 Workshop on Learning Statistical Models from Relational Data, pages 42-49, Austin, TX, 2000. AAAI Press.
 
33
L. Pelkowitz. A continuous relaxation labeling algorithm for Markov random fields. IEEE Transactions on Systems, Man and Cybernetics, 20:709-715, 1990.
34
35
36
37
 
38
 
39
40
 
41
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, UK, 1994.
 
42
D. J. Watts and S. H. Strogatz. Collective dynamics of "small-world" networks. Nature, 393:440--442, 1998.

CITED BY  73

Collaborative Colleagues:
Pedro Domingos: colleagues
Matt Richardson: colleagues