|
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
|
Soumen Chakrabarti , Byron Dom , Piotr Indyk, Enhanced hypertext categorization using hyperlinks, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.307-318, June 01-04, 1998, Seattle, Washington, United States
|
| |
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
|
Gary William Flake , Steve Lawrence , C. Lee Giles, Efficient identification of Web communities, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.150-160, August 20-23, 2000, Boston, Massachusetts, United States
[doi> 10.1145/347090.347121]
|
| |
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
|
David Heckerman , David Maxwell Chickering , Christopher Meek , Robert Rounthwaite , Carl Kadie, Dependency networks for inference, collaborative filtering, and data visualization, The Journal of Machine Learning Research, 1, p.49-75, 9/1/2001
|
 |
18
|
Jonathan L. Herlocker , Joseph A. Konstan , Al Borchers , John Riedl, An algorithmic framework for performing collaborative filtering, Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, p.230-237, August 15-19, 1999, Berkeley, California, United States
[doi> 10.1145/312624.312682]
|
| |
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
|
Charles Lee Isbell, Jr. , Michael J. Kearns , Dave Kormann , Satinder P. Singh , Peter Stone, Cobot in LambdaMOO: A Social Statistics Agent, Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, p.36-41, July 30-August 03, 2000
|
| |
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
|
D. R. Mani , James Drew , Andrew Betz , Piew Datta, Statistics and data mining techniques for lifetime value modeling, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.94-103, August 15-18, 1999, San Diego, California, United States
[doi> 10.1145/312129.312205]
|
| |
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
|
Paul Resnick , Neophytos Iacovou , Mitesh Suchak , Peter Bergstrom , John Riedl, GroupLens: an open architecture for collaborative filtering of netnews, Proceedings of the 1994 ACM conference on Computer supported cooperative work, p.175-186, October 22-26, 1994, Chapel Hill, North Carolina, United States
[doi> 10.1145/192844.192905]
|
 |
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dan Cosley , Shyong K. Lam , Istvan Albert , Joseph A. Konstan , John Riedl, Is seeing believing?: how recommender system interfaces affect users' opinions, Proceedings of the SIGCHI conference on Human factors in computing systems, April 05-10, 2003, Ft. Lauderdale, Florida, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Steffen Staab , Pedro Domingos , Peter Mika , Jennifer Golbeck , Li Ding , Tim Finin , Anupam Joshi , Andrzej Nowak , Robin R. Vallacher, Social Networks Applied, IEEE Intelligent Systems, v.20 n.1, p.80-93, January 2005
|
|
|
Lars Backstrom , Dan Huttenlocher , Jon Kleinberg , Xiangyang Lan, Group formation in large social networks: membership, growth, and evolution, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA
|
|
|
|
|
|
Ding Zhou , Eren Manavoglu , Jia Li , C. Lee Giles , Hongyuan Zha, Probabilistic models for discovering e-communities, Proceedings of the 15th international conference on World Wide Web, May 23-26, 2006, Edinburgh, Scotland
|
|
|
|
|
|
|
|
|
|
|
|
Deng Cai , Zheng Shao , Xiaofei He , Xifeng Yan , Jiawei Han, Mining hidden community in heterogeneous social networks, Proceedings of the 3rd international workshop on Link discovery, p.58-65, August 21-25, 2005, Chicago, Illinois
|
|
|
|
|
|
Xiaodan Song , Belle L. Tseng , Ching-Yung Lin , Ming-Ting Sun, Personalized recommendation driven by information flow, Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, August 06-11, 2006, Seattle, Washington, USA
|
|
|
Louis Licamele , Mustafa Bilgic , Lise Getoor , Nick Roussopoulos, Capital and benefit in social networks, Proceedings of the 3rd international workshop on Link discovery, p.44-51, August 21-25, 2005, Chicago, Illinois
|
|
|
|
|
|
Xiaodan Song , Yun Chi , Koji Hino , Belle L. Tseng, Information flow modeling based on diffusion rate for prediction and ranking, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
|
|
|
|
|
|
|
|
|
Esteban Arcaute , Adam Kirsch , Ravi Kumar , David Liben-Nowell , Sergei Vassilvitskii, On threshold behavior in query incentive networks, Proceedings of the 8th ACM conference on Electronic commerce, June 11-15, 2007, San Diego, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jon M. Kleinberg, Challenges in mining social network data: processes, privacy, and paradoxes, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, p.4-5, August 12-15, 2007, San Jose, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Koustuv Dasgupta , Rahul Singh , Balaji Viswanathan , Dipanjan Chakraborty , Sougata Mukherjea , Amit A. Nanavati , Anupam Joshi, Social ties and their relevance to churn in mobile telecom networks, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France
|
|
|
|
|
|
Xiaowei Xu , Nurcan Yuruk , Zhidan Feng , Thomas A. J. Schweiger, SCAN: a structural clustering algorithm for networks, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA
|
|
|
|
|
|
|
|
|
Ido Guy , Michal Jacovi , Noga Meshulam , Inbal Ronen , Elad Shahar, Public vs. private: comparing public social network information with email, Proceedings of the ACM 2008 conference on Computer supported cooperative work, November 08-12, 2008, San Diego, CA, USA
|
|
|
|
|
|
Hao Ma , Haixuan Yang , Michael R. Lyu , Irwin King, Mining social networks using heat diffusion processes for marketing candidates selection, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Masahiro Kimura , Kazumi Saito , Ryohei Nakano, Extracting influential nodes for information diffusion on a social network, Proceedings of the 22nd national conference on Artificial intelligence, p.1371-1376, July 22-26, 2007, Vancouver, British Columbia, Canada
|
|
|
|
|
|
Oren Ben-Zwi , Danny Hermelin , Daniel Lokshtanov , Ilan Newman, An exact almost optimal algorithm for target set selection in social networks, Proceedings of the tenth ACM conference on Electronic commerce, July 06-10, 2009, Stanford, California, USA
|
|