Advertisement

Mining Retail Transaction Data for Targeting Customers with Headroom - A Case Study

  • Madhu Shashanka
  • Michael Giering
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 296)

Abstract

We outline a method to model customer behavior from retail transaction data. In particular, we focus on the problem of recommending relevant products to consumers. Addressing this problem of filling holes in the baskets of consumers is a fundamental aspect for the success of targeted promotion programs. Another important aspect is the identification of customers who are most likely to spend significantly and whose potential spending ability is not being fully realized. We discuss how to identify such customers with headroom and describe how relevant product categories can be recommended. The data consisted of individual transactions collected over a span of 16 months from a leading retail chain. The method is based on Singular Value Decomposition and can generate significant value for retailers.

Keywords

Singular Value Decomposition Recommender System Product Category Shopping Behavior Retail Chain 
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.

References

  1. 1.
    M. Brand. Incremental Singular Value Decomposition of Uncertain Data with Missing Values. In European Conf on Computer Vision, 2002.Google Scholar
  2. 2.
    M. Brand. Fast Online SVD Revisions for Lightweight Recommender Systems. In SIAM Intl Conf on Data Mining, 2003.Google Scholar
  3. 3.
    S. Chandrasekaran, B. Manjunath, Y. Wang, J. Winkeler, and H. Zhang. An Eigenspace Update Algorithm for Image Analysis. Graphical Models and Image Proc., 59(5):321–332, 1997.CrossRefGoogle Scholar
  4. 4.
    M. Giering. Retail sales prediction and item recommendations using customer demographics at store level. In KDD 2008 (submitted).Google Scholar
  5. 5.
    M. Gu and S. Eisenstat. A Stable and Fast Algorithm for Updating the Singular Value Decomposition. Technical Report YALEU/DCS/RR-966, Yale University, 1994.Google Scholar
  6. 6.
    D. Gupta and K. Goldberg. Jester 2.0: A linear time collaborative filtering algorithm applied to jokes. In Proc. of SIGIR, 1999.Google Scholar
  7. 7.
    B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system - a case study. In Web Mining for ECommerce, 2000.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2009

Authors and Affiliations

  • Madhu Shashanka
  • Michael Giering

There are no affiliations available

Personalised recommendations