Data Mining for the Category Management in the Retail Market

  • Jochen GarckeEmail author
  • Michael Griebel
  • Michael Thess


Worldwide the retail market is under a severe competitive pressure. The retail trade in Germany in particular is internationally recognized as the most competitive market. To survive in this market most retailers use undirected mass marketing extensively. All prospective customers receive the same huge catalogues, countless advertising pamphlets, intrusive speaker announcements and flashy banner ads. In the end the customers are not only annoyed but the response rates of advertising campaigns are dropping for years. To avoid this, an individualization of mass marketing is recommended where customers receive individual offers specific to their needs. The objective is to offer the right customer at the right time for the right price the right product or content. This turns out to be primarily a mathematical problem concerning the areas of statistics, optimization, analysis and numerics. The arising problems of regression, clustering, and optimal control are typically of high dimensions and have huge amounts of data and therefore need new mathematical concepts and algorithms.


Customer Relationship Management Price Optimization Sparse Grid Retail Market Category Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957) zbMATHGoogle Scholar
  2. 2.
    Berry, M.J.A., Linoff, G.S.: Data Mining Techniques: For Marketing, Sales, and Customer Relationship Management. Wiley, New York (2004) Google Scholar
  3. 3.
    Beylkin, G., Mohlenkamp, M.J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26, 2133–2159 (2005) zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Börm, S., Grasedyck, L., Hackbusch, W.: Hierarchical Matrices. Lecture Note, vol. 21. Max Planck Institute for Mathematics in the Sciences, Leipzig (2003) Google Scholar
  5. 5.
    Bungartz, H.J., Griebel, M.: Sparse grids. Acta Numer. 13, 147–269 (2004) CrossRefMathSciNetGoogle Scholar
  6. 6.
    Garcke, J., Griebel, M., Thess, M.: Data mining with sparse grids. Computing 67, 225–253 (2001) zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Girosi, F., Jones, M., Poggio, T.: Regularization theory and neural network architectures. Neural Comput. 7, 219–265 (1995) CrossRefGoogle Scholar
  8. 8.
    Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer, Berlin (2001) zbMATHGoogle Scholar
  9. 9.
    Munos, R.: A study of reinforcement learning in the continuous case by the means of viscosity solutions. Mach. Learn. 40(3), 265–299 (2000) zbMATHCrossRefGoogle Scholar
  10. 10.
    Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998) Google Scholar
  11. 11.
    Zenger, C.: Sparse grids. In: Parallel Algorithms for Partial Differential Equations, Proceedings of the Sixth GAMM-Seminar, Kiel, 1990. Notes on Num. Fluid Mech., vol. 31, pp. 241–251. Vieweg, Weisbaden (1991) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.MA 3-3TU BerlinBerlinGermany
  2. 2.Institut für Numerische SimulationUniversität BonnBonnGermany
  3. 3.The Realtime Analytics CompanyPrudsys AGChemnitzGermany

Personalised recommendations