Comparing Simple Association-Rules and Repeat-Buying Based Recommender Systems in a B2B Environment

  • Andreas Geyer-Schulz
  • Michael Hahsler
  • Anke Thede
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)


In this contribution we present a systematic evaluation and comparison of recommender systems based on simple association rules and on repeat-buying theory. Both recommender services are based on the customer purchase histories of a medium-sized B2B-merchant for computer accessories. With the help of product managers an evaluation set for recommendations was generated. With regard to this evaluation set, recommendations produced by both methods are evaluated and several error measures are computed. This provides an empirical test whether frequent item sets or outliers of a stochastic purchase incidence model are suitable concepts for automatically generating recommendations. Furthermore, the loss functions (performance measures) of the two methods are compared and the sensitivity with regard to a misspecification of the model parameters is discussed.


Association Rule Recommender System Mining Association Rule Recommender Service Market Basket 
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. CHATFIELD, C. and EHRENBERG, A. S. C. and GOODHARDT, G. J. (1966): Progress on simplified model of stationary purchasing behaviour. Journal of the Royal Statistical Society, Series A, 129(3) 317–367.CrossRefGoogle Scholar
  2. EHRENBERG, A. S. C. (1988): Repeat-Buying: Facts, Theory and Application. Charles Griffin & Company Ltd., London.Google Scholar
  3. AGRAWAL, R. and IMIELINSKI, T. and SWAMI, A. (1993): Mining Association Rules between Sets of Items in Large Databases. In: P. Buneman and S. Jajodia (Eds.): Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press.Google Scholar
  4. AGRAWAL, R. and SRIKANT, R. (1994): Fast algorithms for mining association rules. In: J. B. Bocca and M. Jarke and C. Zaniolo (Eds.): Proceedings of the 20th international Conference on very large databases. 487–499.Google Scholar
  5. HOUTSMA, M. and SWAMI, A. (1995): Set-oriented mining for association rules in relational databases. In: P. S. Yu and A. L. P. Chen (Eds.): Proceedings of the 11th International Conference on Data Engineering. IEEE Computer Society, 25–33.Google Scholar
  6. BRIN, S. and MOTWANI, R. and ULLMAN, J. and TSUR, S. (1997): Dynamic itemset counting and implication rules for market basket data. In: J. M. Peckman (Ed.): Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 255–264.Google Scholar
  7. AGGARWAL, C. C. and YU, P. S. (1998): A new framework for itemset generation. In: A. Mendelson and J. Paredaens (Eds.): PODS 98, Symposium on Principles of Database Systems. ACM press, 18–24.Google Scholar
  8. BAYARDO, R. and AGRAWAL, R. and GUNOPULOS, D. (2000): Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4 (2/3), 217–240.CrossRefGoogle Scholar
  9. BOEHM, W. and GEYER-SCHULZ, A. and HAHSLER, M. and JAHN, M. (2001): Repeat-buying theory and its applications for recommender services. In: Proceedings of the 25th Annual Conference of the GfKl. Springer-Verlag, Heidelberg.Google Scholar
  10. GEYER-SCHULZ, A. and HAHSLER, M. (2001): A customer purchase incidence model applied to recommender systems. In: ACM WebKDD 2001 Workshop on Mining Web Log Data Across All Consumer Touchpoints. Springer-Verlag.Google Scholar
  11. GEYER-SCHULZ, A. and HAHSLER, M. (2002): Evaluation of Recommender Algorithms for an Internet Information Broker based on Simple Association Rules and on Repeat-Buying Theory. In: Proceedings of the WebKDD 2002: Web Mining for Usage Patterns and User Profiles. Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Andreas Geyer-Schulz
    • 1
  • Michael Hahsler
    • 2
  • Anke Thede
    • 1
  1. 1.Schroff-Stiftungslehrstuhl Informationsdienste und elektronische MärkteUniversität Karlsruhe (TH)KarlsruheGermany
  2. 2.Institut für Informationsverarbeitung und InformationswirtschaftWU-WienWienAustria

Personalised recommendations