Improving personalization solutions through optimal segmentation of customer bases

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 307-318

  Jiang, Tianyi ^a   Tuzhilin, Alexander ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

1 to 1 marketing; Customer profiles; Customer segmentation; Marketing application; Personalization

Indexed keywords

CUSTOMER BASES; CUSTOMER PROFILES; MARKETING APPLICATION; OPTIMAL SEGMENTATION; TRANSACTIONAL DATA;

CLUSTERING ALGORITHMS; COSTS; CUSTOMER SATISFACTION; MICE (COMPUTER PERIPHERALS); ONLINE SEARCHING; OPTIMIZATION; PROBLEM SOLVING; STATISTICS; WORLD WIDE WEB;

DATA MINING;

EID: 42149113083     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.87     Document Type: Conference Paper

References (29)

1. Adomavicius, G. and A. Tuzhilin, Personalization technologies: A process-oriented perspective. Communication of the CAM, 2005.
2. Beyer, D. and R. Ogier. Tabu learning: a neural network search method for solving nonconvex optimization problems. in International Joint Conference on Neural Networks. 1991. Singapore: IEEE and INNS.
3. Brijs, T., et al. Using shopping baskets to cluster supermarket shoppers, in AARTF. 2001. Amelia Island Plantation, FL.
4. Brucker, P., On the complexity of clustering problems. Optimization and Operations Research, ed. R. Henn, B. Korte, and W. Oettli. 1977: Springer Verlag. 45-54.
5. CACM, Comm of ACM, in Special Issue on Personalization. 2000.
6. Dougherty, J., R. Kohavi, and M. Sahami. Supervised and Unsupervised Discretization of Continuous Features. in 12th ICML. 1995. San Francisco, CA: Morgan Kaufmann.
7. Duda, R., P. Hart, and D. Stork, Pattern Classification. 2 ed. 2001, New York, NY: John Wiley & Sons, Inc.
8. Fayyad, U.M. and K.B. Irani. Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. in IJCAI. 1993.
9. Gomory, R.E., Outline of an algorithm for integer solutions to linear programs. Bulletin American Mathematical Society, 1958. 64: p. 275-278.
10. Guignard, M. and S. Kim, Lagrangian decomposition: a model yielding stronger Lagrangian bounds. Mathematical Programming, 1987. 39: p. 215-228.
11. Hansen, P. The steepest ascent mildest descent heuristic for combinatorial programming. in congress on Numerical Methods in Combinatorial Optimization. 1986. Capri, Italy.
12. Hochbaum, S.D. and B.D. Shmoys, A Best Possible Heuristic for the K-Center Problem. Mathematics of Operational Research, 1985.
13. Hoffman, K., Combinatorial Optimization: Current Successes and Directions for the Future. Journal of Computational and Applied Mathematics, 2000. 124: p. 341-360.
14. Jiang, T. and A. Tuzhilin, Segmenting Customers from Population to Individual: Does 1-to-1 Keep Your Customers Forever? IEEE TKDE, 2006. 18(10).
15. John, G.H. and P. Langley. Estimating Continuous Distributions in Bayesian Classifiers, in UAI. 1995.
16. Kotler, P., Marketing Management. 11 ed. 2003: Prentice Hall.
17. Land, A.H. and A.G. Doig, An automatic method for solving discrete programming problems. Econometrica, 1960. 28(97).
18. Lin, S. and B.W. Kernigham, An effective implementation for the traveling salesman problem. Operations Research, 1973. 21(498-516).
19. Mendenhall, W. and R.J. Beaver, Introduction to probability and statistics. 1994: Thomson Pub.
20. Mühlenbein, H., Parallel genetic algorithms in combinatorial optimization. Computer Science and Operations Research, ed. O. Blaci. 1992, New York: Pergamon Press.
21. Novo, J., Drilling Down: Turning Customer Data Into Profits with a Spreadsheet. 2004: Booklocker.com.
22. Ozdal, M. and C. Aykanat, Clustering Based on Data Patterns using Hypergraph Models. Data Mining and Knowledge Discovery, 2004. 9: p. 29-57.
23. Peppers, D. and M. Rogers, Enterprise One to One. 1997, New York: Bantam Doubleday Dell Pub. Group Inc.
24. Quinlan, R., C4.5: Programs for Machine Learning. 1993.
25. Smith, W., Product Differentiation and Market Segmentation as Alternative Marketing Strategies. Journal of Marketing, 1956. 21: p. 3-8.
26. Wedel, M. and W. Kamakura, Market Segmentation: Conceptual and Methodological Foundations. 2nd ed. 2000: Kluwer Publishers.
27. Witten, I.H. and E. Frank, Data Mining: practical machine learning tools and techniques with Java implementations. 2000.
28. Yang, Y. and B. Padmanabhan. Segmenting Customer Trans. Using a Pattern-Based Clustering Approach. in ICDM. 2003.
29. Zipf, G.K., Human Behavior and the Principle of Least Effort. 1949, New York: Addison-Wesley.