Market Basket Analysis of Retail Data: Supervised Learning Approach
In this work we discuss a supervised learning approach for identification of frequent itemsets and association rules from transactional data. This task is typically encountered in market basket analysis, where the goal is to find subsets of products that are frequently purchased in combination.
In this work we compare the traditional approach and the supervised learning approach to find association rules in a real-world retail data set using two well known algorithm, namely Apriori and PRIM.
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, pp. 487–499 (1994)Google Scholar
- 2.Bodon, F.: A survey on frequent itemset mining. Tech. rep., Budapest University of Technology and Economic (2006)Google Scholar
- 3.Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: A case study. In: Knowledge Discovery and Data Mining, pp. 254–260 (1999)Google Scholar
- 7.R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2011), ISBN 3-900051-07-0, http://www.R-project.org,