Mining the network value of customers

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.

[1]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[2]  J. Besag Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[3]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[4]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Editors , 1986, Brain Research Bulletin.

[6]  Bojan Cestnik,et al.  Estimating Probabilities: A Crucial Task in Machine Learning , 1990, ECAI.

[7]  Lionel Pelkowitz,et al.  A continuous relaxation labeling algorithm for Markov random fields , 1990, IEEE Trans. Syst. Man Cybern..

[8]  Michael F. Schwartz,et al.  Discovering shared interests using graph analysis , 1993, CACM.

[9]  Anil K. Jain,et al.  Markov random fields : theory and application , 1993 .

[10]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[11]  Arthur Middleton Hughes The Complete Database Marketer: Second Generation Strategies and Techniques for Tapping the Power of Your Customer Database , 1995 .

[12]  D. Iacobucci Networks in Marketing , 1996 .

[13]  D. Krackhardt Structural Leverage in Marketing , 1996 .

[14]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[15]  James Rucker,et al.  Siteseer: personalized navigation for the Web , 1997, CACM.

[16]  Loren Terveen,et al.  PHOAKS: a system for sharing recommendations , 1997, CACM.

[17]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[18]  Charles X. Ling,et al.  Data Mining for Direct Marketing: Problems and Solutions , 1998, KDD.

[19]  Piotr Indyk,et al.  Enhanced hypertext categorization using hyperlinks , 1998, SIGMOD '98.

[20]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[21]  Hal R. Varian,et al.  Information rules - a strategic guide to the network economy , 1999 .

[22]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[23]  M. KleinbergJon Authoritative sources in a hyperlinked environment , 1999 .

[24]  John Riedl,et al.  An algorithmic framework for performing collaborative filtering , 1999, SIGIR '99.

[25]  Lise Getoor,et al.  Learning Probabilistic Relational Models , 1999, IJCAI.

[26]  Gregory Piatetsky-Shapiro,et al.  Estimating campaign benefits and modeling lift , 1999, KDD '99.

[27]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

[28]  Piew Datta,et al.  Statistics and data mining techniques for lifetime value modeling , 1999, KDD '99.

[29]  Peter Stone,et al.  Cobot in LambdaMOO: A Social Statistics Agent , 2000, AAAI/IAAI.

[30]  David Maxwell Chickering,et al.  Dependency Networks for Inference, Collaborative Filtering, and Data Visualization , 2000, J. Mach. Learn. Res..

[31]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[32]  David Maxwell Chickering,et al.  A Decision Theoretic Approach to Targeted Advertising , 2000, UAI.

[33]  Katja Gelbrich,et al.  Value Miner: A Data Mining Environment for the Calculation of the Customer Lifetime Value with Application to the Automotive Industry , 2000, ECML.

[34]  S. Jurvetson What exactly is viral marketing , 2000 .

[35]  Lawrence B. Holder,et al.  Graph-Based Data Mining , 2000, IEEE Intell. Syst..

[36]  R. Dye The buzz on buzz. , 2000, Harvard business review.

[37]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[38]  Jennifer Neville,et al.  Iterative Classification in Relational Data , 2000 .

[39]  Martin Suter,et al.  Small World , 2002 .

[40]  S. Griffis EDITOR , 1997, Journal of Navigation.