Mining the network value of customers

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 57-66

  Domingos, Pedro ^a   Richardson, Matt ^a  

^a Box 352350 ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATABASE SYSTEMS; LEARNING SYSTEMS; MARKETING; MARKOV PROCESSES;

DEPENDENCY NETWORKS;

DATA MINING;

EID: 0035789667     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502525     Document Type: Conference Paper

References (42)

1. A. L. Barabási, R. Albert, and H. Jong. Scale-free characteristics of random networks: The topology of the World Wide Web. Physics 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. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the Seventh International World Wide Web Conference, Brisbane, Australia, 1998. Elsevier.
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. S. Chakrabarti, B. Dom, and P. Indyk. Enhanced hypertext categorization using hyperlinks. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 307-318, Seattle, WA, 1998. ACM Press.
7. R. Chellappa and A. K. Jain, editors. Markov Random Fields: Theory and Application. Academic Press, Boston, MA, 1993.
8. D. M. Chickering and D. Heckerman. A decision theoretic approach to targeted advertising. In Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence, Stanford, CA, 2000. Morgan Kaufmann.
9. D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15:32-41, 2000.
10. G. F. Cooper. A simple constraint-based algorithm for efficiently mining observational databases for causal relationships. Data Mining and Knowledge Discovery, 1:203-224, 1997.
11. P. Domingos and M. Pazzani. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29:103-130, 1997.
12. R. Dye. The buzz on buzz. Harvard Business Review, 78(6):139-146, 2000.
13. Go W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of Web communities. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 150-160, Boston, MA, 2000. ACM Press.
14. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1300-1307, Stockholm, Sweden, 1999. Morgan Kaufmann.
15. K. Gelbrich and R. Nakhaeizadeh. Value Miner: A data mining environment for the calculation of the customer lifetime value with application to the automotive industry. In Proceedings of the Eleventh European Conference on Machine Learning, pages 154-161, Barcelona, Spain, 2000. Springer.
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. D. Heckerman, D. M. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1:49-75, 2000.
18. J. Herlocker, J. Konstan, A. Botchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proceedings of the 1999 Conference on Research and Development in Information Retrieval, Berkeley, CA, 1999.
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. C. L. Isbell, Jr., M. Kearns, D. Korman, S. Singh, and P. Stone. Cobot in LambdaMOO: A social statistics agent. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pages 36-41, Austin, TX, 2000. AAAI Press.
22. D. R. 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. H. Kautz, B. Selman, and M. Shah. ReferralWeb: Combining social networks and collaborative filtering. Communications of the ACM, 40(3):63-66, 1997.
25. R. Kindermann and J. L. Snell. Markov Random Fields and Their Applications. American Mathematical Society, Providence, RI, 1980.
26. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 668-677, Baltimore, MD, 1998. ACM Press.
27. D. Krackhardt. Structural leverage in marketing. In D. Iacobucci, editor, Networks in Marketing, pages 50-59. Sage, Thousand Oaks, CA, 1996.
28. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the Web. In Proceedings of the Twenty-Fifth International Conference on Very Large Databases, pages 639-650, Edinburgh, Scotland, 1999. Morgan Kaufmann.
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, J. Drew, A. Betz, and P. Datta. Statistics and data mining techniques for lifetime value modeling. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 94-103, New York, NY, 1999. ACM Press.
31. S. Milgram. The small world problem. Psychology Today, 2:60-67, 1967.
32. J. Neville and D. Jenson. 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. G. Piatetsky-Shapiro and B. Masand. Estimating campaign benefits and modeling lift. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 185-193, San Diego, CA, 1999. ACM Press.
35. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. GroupLens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, pages 175-186, New York, NY, 1994. ACM Press.
36. J. Rucker and M. J. Polanco. Siteseer: Personalized navigation for the web. Communications of the ACM, 40(3):73-76, 1997.
37. M. F. Schwartz and D. C. M. Wood. Discovering shared interests using graph analysis. Communications of the ACM, 36(8):78-89, 1993.
38. C. Shapiro and H. R. Varian. Information Rules: A Strategic Guide to the Network Economy. Harvard Business School Press, Boston, MA, 1999.
39. C. Silverstein, S. Brin, R. Motwani, and J. Ullman. Scalable techniques for mining causal structures. Data Mining and Knowledge Discovery, 4:163-192, 2000.
40. L. Terveen, W. Hill, B. Amento, D. McDonald, and J. Creter. PHOAKS: A system for sharing recommendations. Communications of the ACM, 40(3):59-62, 1997.
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.