Skip to main content

Building an Association Rules Framework for Target Marketing

  • Conference paper
Data Analysis, Machine Learning and Applications

Abstract

The discovery of association rules is a popular approach to detect cross-category purchase correlations hidden in large amounts of transaction data and extensive retail assortments. Traditionally, such item or category associations are studied on an ‘average’ view of the market and do not reflect heterogeneity across customers. With the advent of loyalty programs, however, tracking each program member’s transactions has become facilitated, enabling retailers to customize their direct marketing efforts more effectively by utilizing cross-category purchase dependencies at a more disaggregate level. In this paper, we present the building blocks of an analytical framework that allows retailers to derive customer segment-specific associations among categories for subsequent target marketing. The proposed procedure starts with a segmentation of customers based on their transaction histories using a constrained version of K-centroids clustering. In a second step, associations are generated separately for each segment. Finally, methods for grouping and sorting the identified associations are provided. The approach is demonstrated with data from a grocery retailing loyalty program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • AGRAWAL, R., IMIELINSKI, T. and SWAMI, A. (1993): Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. Washington D.C., 207-216.

    Google Scholar 

  • BERRY, M. and LINOFF G. (2004): Data mining techniques. Wiley, Indianapolis.

    Google Scholar 

  • BOZTUG, Y. and REUTTERER, T. (2007): A combined approach for segment-specific anal-ysis of market basket data. In: European Journal of Operational Research, forthcoming.

    Google Scholar 

  • DECKER, R. (2005): Market Basket Analysis by Means of a Growing Neural Network. The International Review of Retail, Distribution and Consumer Research, 15, 151-169.

    Article  Google Scholar 

  • GUPTA, G. K., STREHL, A. and GOSH, J (1999): Distance based clustering of association rules. In: Intelligent Engineering Systems Through Artificial Neural Networks. ASME Press, New York, 759-764.

    Google Scholar 

  • HAHSLER, M., HORNIK, K. and REUTTERER, T. (2006): Implications of Probabilistic Data Modeling for Mining Association Rules. In: M. Spiliopoulou, R. Kruse, C. Borgelt, A. Nürnberger, W. Gaul (Eds.): From Data and Information Analysis to Knowledge Engineering. Springer, Heidelberg, 598-605.

    Chapter  Google Scholar 

  • KAUFMAN, L. and ROUSSEEUW, P. J. (2005): Finding Groups in Data: An Introduction to Cluster Analysis., Wiley, New York.

    Google Scholar 

  • LEISCH, F. and GRÜN, B. (2006): Extending standard cluster algorithms to allow for group constraints. In: A. Rizzi, M. Vichi (Eds.): Compstat 2006, Proceedings in Computational Statistics. Physica-Verlag, Heidelberg, 885-892.

    Google Scholar 

  • LEISCH, F. (2006): A toolbox for k-centroids cluster analysis. In: Computational Statistics and Data Analysis, 51(2), 526-544.

    Article  MATH  MathSciNet  Google Scholar 

  • OMIECINSKI, E. (2003): Alternative Interest Measures for Mining Associations in Databases. In: IEEE Transactions on Knowledge and Data Engineering, 15(1), 57-69.

    Article  MathSciNet  Google Scholar 

  • PRINZIE, A. and VAN DEN POEL, D. (2005): Constrained optimization of data-mining prob-lems to improve model performance. A direct-marketing application. In: Expert Systems with Applications, 29, 630-640.

    Article  Google Scholar 

  • REUTTERER, T., MILD, A., NATTER, M. and TAUDES, A. (2006): A dynamic segmenta-tion approach for targeting and customizing direct marketing campaigns. In: Journal of Interactive Marketing, 20(3), 43-57.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

March, N., Reutterer, T. (2008). Building an Association Rules Framework for Target Marketing. In: Preisach, C., Burkhardt, H., Schmidt-Thieme, L., Decker, R. (eds) Data Analysis, Machine Learning and Applications. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78246-9_52

Download citation

Publish with us

Policies and ethics