On the use of optimization for data mining: Theoretical interactions and eCRM opportunities

Management Science

Volumn 49, Issue 10, 2003, Pages 1327-1343

  Padmanabhan, Balaji ^a   Tuzhilin, Alexander ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Data mining; eCRM applications; Optimization

Indexed keywords

CUSTOMER SATISFACTION; DATA MINING; ELECTRONIC COMMERCE; OPTIMIZATION;

CUSTOMER ANALYSIS; CUSTOMER INTERACTIONS; ELECTRONIC CUSTOMER RELATIONSHIP MANAGEMENT;

INDUSTRIAL MANAGEMENT;

EID: 0242624459     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.49.10.1327.17310     Document Type: Article

References (74)

1. Adomavicius, G., A. Tuzhilin. 2001. Expert-driven validation of rule-based user models in personalization applications. Internat. J. Data Mining Knowledge Discovery 5 33-58.
2. ____, ____. 2003. Recommendation technologies: Survey of current methods and possible extensions. Working paper, Stern School of Business, New York University, New York.
3. Agrawal, R., H. Mannila, R. Srikant, H. Toivonen, A. I. Verkamo. 1995. Fast discovery of association rules. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy, eds. Advances in Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA.
4. Balabanovic, M., Y. Shoham. 1997. Fab: Content-based, collaborative recommendation. Comm. ACM 40(3) 66-72.
5. Battiti, R., G. Tecchiolli. 1995. Training neural nets with the reactive tabu search. IEEE Trans. Neural Networks 6(5) 1185-1200.
6. Bennett, K. P., O. L. Mangasarian. 1992. Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Software 1 23-34.
7. Blattberg, R. C., J. Deighton. 1991. Interactive marketing: Exploiting the age of addressability. Sloan Management Rev. (Fall) 5-14.
8. Boros, E., T. Ibaraki, K. Makino. 1995. Error-free and best-fit extensions of partially defined Boolean functions. Rutcor research report RRR 14-95, Rutgers University, Piscataway, NJ.
9. ____, P. L. Hammer, T. Ibaraki, A. Kogan. 1997. Logical analysis of numerical data. Math. Programming 79 163-190.
10. Bradley, P. S., U. M. Fayyad, O. L. Mangasarian. 1999. Mathematical programming for data mining: Formulations and challenges. INFORMS J. Comput. 11(3) 217-238.
11. ____, O. L. Mangasarian, W. N. Street. 1997. Clustering via concave minimization. M. C. Mozer, M. I. Jordan, T. Petsche, eds. Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA.
12. ____, ____, ____. 1998. Feature selection via mathematical programming. INFORMS J. Comput. 10(2) 209-217.
13. Brijs, T., G. Swinnen, K. Vanhoof, G. Wets. 1999. Using association rules for product assortment decisions: A case study. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining, San Diego, CA.
14. Brodley, C., R. Kohavi. 2000. KDD-cup 2000 organizer's report: Peeling the onion. SIGKDD Explorations 2(2) 86-98.
15. Burges, C. J. C. 1998. A tutorial on support vector machines for pattern recognition. Data Mining Knowledge Discovery 2(2) 121-167.
16. Campbell, D., R. Erdahl, D. Johnson, E. Bibelnieks, M. Haydock, M. Bullock, H. Crowder. 2001. Optimizing customer mail streams at Fingerhut. Interfaces 31(1) 77-90.
17. Chen, H., S. T. Dumais. 2000. Bringing order to the Web: Automatically categorizing search results. Proc. CHI 2000, Human Factors Comput. Systems. The Hague, The Netherlands, 145-152.
18. Cohn, D., Z. Ghahramani, M. Jordan. 1996. Active learning with statistical models. J. Artificial Intelligence Res. 4 129-145.
19. Cooley, R., B. Mobasher. 1999. Data preparation for mining World Wide Web browsing patterns. Knowledge Inform. Systems 1(1) 5-32.
20. Crama, Y., P. L. Hammer, T. Ibaraki. 1988. Cause-effect relationships and partially defined Boolean functions. Ann. Oper. Res. 16 299-326.
21. Davis, O. 1998. Personal communications, October.
22. Dempster, A. P., N. M. Laird, D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B 39 1-38.
23. Dreze, X., A. Bonfrer. 2002. To pester or leave alone: Lifetime value maximization through optimal communication timing. Working paper, Marketing Department, University of California, Los Angeles, CA.
24. Dver, A. 2003. Customer relationship management: The good, the bad, the future. Bus. Week (April 28).
25. Dwyer, F. R. 1989. Customer lifetime valuation to support marketing decision making. J. Direct Marketing 3(4) 8-15.
26. Engelson, S., Dagan. 1999. Committee-based sample selection for probabilistic classifiers. J. Artificial Intelligence Res. 11 335-360.
27. Fayyad, U. M., G. Piatetsky-Shapiro, P. Smyth. 1996. From data mining to knowledge discovery: An overview. Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Cambridge, MA.
28. Fawcett, T., F. Provost. 1996. Combining data mining and machine learning for efficient user profiling. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining (ACM SIGKDD), Portland, OR.
29. Fisher, R. A. 1936. The use of multiple measurements in taxonomic problems. Ann. Eugenics 7(2) 179-188.
30. Freund, Y., H. Seung, E. Shamir, N. Tishby. 1997. Selective sampling using query by committee algorithm. Machine Learning 28 133-168.
31. Fu, Z., B. Golden, S. Lele, S. Raghavan, E. Wasil. 2003. A genetic algorithm-based approach for building accurate decision trees. INFORMS J. Comput. 15(1) 3-22.
32. Geoffrion, A. M., R. Krishnan. 2001. Prospects for operations research in the e-business era. Interfaces 31(2) 6-36.
33. Glover, F. 1989. Tabu search, Part I. ORSA J. Comput. 1 190-206.
34. Grinold, R. C. 1972. Mathematical programming methods of pattern classification. Management Sci. 19 272-289.
35. Gupta, S., D. R. Lehmann, J. A. Stuart. 2001. Valuing customers. Working paper, Columbia University, New York.
36. Hand, D., H. Mannila, P. Smyth. 2001. Principles of Data Mining, MIT Press, Cambridge, MA.
37. Hasenjager, M., H. Ritter. 1999. Active learning in neural networks. Working paper, University of Bielefeld, Bielefeld, Germany.
38. Hong, S. J. 1995. R-MINI: An iterative approach for generating minimal rules from examples. IEEE Trans. Knowledge Data Engrg. 9(5) 709-717.
39. Jaronski, W., J. Bloemer, K. Vanhoof, G. Wets. 2001. Use of Bayesian belief networks to help understand online audience. Proc. Data Mining Marketing Appl. Workshop ECML/PKDD 2001. Freiburg, Germany.
40. Kennedy, H., C. Chinniah, P. Bradbeer, L. Morss. 1997. The construction and evaluation of decision trees: A comparison of evolutionary and concept learning methods. D. Corne, J. L Shapiro, eds. Evolutionary Computing. Lecture Notes in Computer Science, Springer-Verlag, 147-161.
41. Little, R. J., D. B. Rubin. 1987. Statistical Analysis with Missing Data. John Wiley and Sons, New York.
42. MacKay, D. J. C. 1992. Information-based objective functions for active data selection. Neural Comput. 4(4) 590-604.
43. Mangasarian, O. L. 1965. Linear and nonlinear separation of patterns by linear programming. Oper. Res. 13 455-461.
44. ____. 1968. Multisurface method of pattern separation. IEEE Trans. Inform. Theory 14(6) 801-807.
45. ____. 1997. Mathematical programming in data mining. Data Mining Knowledge Discovery J. 1(2) 183-210.
46. ____, R. Setiono, W. H. Wolberg. 1990. Pattern recognition via linear programming: Theory and application to medical diagnosis. T. F. Coleman, Y. Li, eds. Large-Scale Numerical Optimization. SIAM, Philadelphia, PA, 22-31.
47. Mani, D. R., J. Drew, A. Betz, P. Datta. 1999. Statistics and data mining techniques for lifetime value modeling. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining, San Diego, CA.
48. Mannino, M. V., V. S. Mookerjee. 1999. Optimizing expert systems: Heuristics for efficiently generating low cost information acquisition strategies. INFORMS J. Comput. 11(3) 278-291.
49. Mitchell, T. 1997. Machine Learning. McGraw-Hill, New York.
50. Olafsson, S., J. Yang. 2002. Scalable optimization-based feature selection. Proc. SIAM Workshop Discrete Math. Data Mining. Arlington, VA, 53-64.
51. Padmanabhan, B., Z. Zhiqiang, S. Kimbrough. 2001. Personalization from incomplete data: What you don't know can hurt. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining (ACM SIGKDD), San Francisco, CA.
52. Pazzani, M. 1999. A framework for collaborative, content-based and demographic filtering. Artificial Intelligence Rev. (December) 393-408.
53. Perkowitz, M., O. Etzioni. 1998. Adaptive web sites: Automatically synthesizing web pages. Proc. National Conf. Artificial Intelligence, Madison, WI.
54. Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufman, San Mateo, CA.
55. ____, R. L. Rivest. 1989. Inferring decision trees using the minimum description length principle. Inform. Comput. 80 227-248.
56. Rissanen, J. 1978. Modeling by shortest data description. Automatica 14, 465-471.
57. Rosset, S., E Neumann, U. Eick, N. Vatnik, Y. Idan. 2002. Customer lifetime value modeling and its use for customer retention planning. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining. Edmonton, Alberta, Canada.
58. Rumelhart, D. E., G. E. Hinton, R. J. Williams. 1986. Learning internal representations by error propagation. D. E. Rumelhart, J. L. McClelland, eds. Parallel Data Processing, Vol. 1, MIT Press, Cambridge, MA, 318-362.
59. Rymon, R. 1994. On Kernel rules and prime implicants. Proc. National Conf. Artificial Intelligence, AAAI, Seattle, WA.
60. Sear-Tsechansky, M., F. J. Provost. 2001. Active learning for class probability estimation and ranking. Internat. Joint Conf. Artificial Intelligence, Seattle, WA.
61. Schafer, J. B., J. A. Konstan, J. Riedl. 2001. E-commerce recommendation applications. J. Data Mining Knowledge Discovery 5(1, 2) 115-153.
62. Schmittlein, D. C., D. G. Morrison, R. Colombo. 1987. Counting your customers: Who are they and what will they do next? Management Sci. 33(1) 1-24.
63. Smith, F. W. 1968. Pattern classifier design by linear programming. IEEE Trans. Comput. 4 367-372.
64. Srikant, R., Y. Yang. 2001. Mining web logs to improve website organization. Proc. Tenth World Wide Web Conf., Hong Kong.
65. Srivastava, J., R. Cooley, M. Deshpande, P. Tan. 2000. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explorations 1(2).
66. Swift, R. 2002. Analytical CRM powers profitable relationships: Creating success by letting customers guide you. DM Rev. (February).
67. Tan, P. N., V. Kumar, J. Srivastava. 2002. Selecting the right interestingness measure for association patterns. Proc. ACM Internat. Conf. Knowledge Discovery Data Mining. Edmonton, Alberta, Canada.
68. Theusinger, C., K. Huber. 2000. Analyzing the footsteps of your customers. WEBKDD.
69. Thrun, S., J. Langford. 1997. Monte Carlo hidden Markov models. Technical report CMU-CS-98-179, Carnegie Mellon University, Pittsburgh, PA.
70. VanderMeer, D., K. Dutta, A. Datta, K. Ramamritham, S. Navathe. 2000. A. Enabling scalable online personalization on the web. Proc. ACM Conf. Electronic Commerce. Minneapolis, MN.
71. Vapnik, V. N. 1995. The Nature of the Statistical Learning Theory. Springer, New York.
72. Xue, L., M. I. Jordan. 1996. On convergence properties of the EM algorithm for Gaussian mixtures. Neural Comput. 8(1) 129-151.
73. Ypma, A., T. Heskes. 2002. Categorization of web pages and user clustering with mixtures of hidden Markov models. Proc. Workshop Web Knowledge Discovery Data Mining (WEBKDD 2002). Edmonton, Alberta, Canada, 31-43.
74. Zheng, Z., B. Padmanabhan, S. Kimbrough. 2003. On data preprocessing biases in web usage mining. INFORMS J. Comput. 15(2) 148-170.