Abstract
This paper addresses a very important question—how to select the right products to promote in order to maximize promotional benefit. We set up a framework to incorporate promotion decisions into the data-mining process, formulate the profit maximization problem as an optimization problem, and propose a heuristic search solution to discover the right products to promote. Moreover, we are able to get access to real supermarket data and apply our solution to help achieve higher profits. Our experimental results on both synthetic data and real supermarket data demonstrate that our framework and method are highly effective and can potentially bring huge profit gains to a marketing campaign.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Adomavicius G, Tuzhilin A (1997) Discovery of actionable patterns in databases: the action hierarchy approach. In: Proceedings of the third international conference on knowledge discovery and data mining, pp 111–114
Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference on management of data, pp 207–216
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases, pp 487–499
Betancourt R, Gautschi D (1990) Demand complementarities, household production, and retail assortments. Mark Sci 9(2): 146–161
Boley M, Grosskreutz H (2009) Approximating the number of frequent sets in dense data. Knowl Inf Syst 21(1): 65–89
Brijs T, Swinnen G, Vanhoof K et al (1999) Using association rules for product assortment decisions: a case study. In: Proceedings of the fifth international conference on knowledge discovery and data mining, pp 254–260
Brijs T, Goethals B, Swinnen G et al (2000) A data mining framework for optimal product selection in retail supermarket data: the generalized PROFSET model. In: Proceedings of ACM SIGKDD, pp 300–304
Brijs T, Swinnen G, Vanhoof K et al (2004) Building an association rules framework to improve product assortment decisions. Data Min Knowl Discov 8: 7–23
Brin S, Motwani R, Ullman J et al (1997) Dynamic itemset counting and implication rules for market basket data. In: Proceedings ACM SIGMOD international conference on management of data, pp 255–264
Chintagunta P, Haldar S (1998) Investigating purchase timing behavior in two related product categories. J Mark Res 35: 43–53
Hämäläinen W (2010) StatApriori: an efficient algorithm for searching statistically significant association rules. Knowl Inf Syst 23(3): 373–399
Han J, Pei J, Yin Y et al (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8: 53–87
Li S, Sun B, Wilcox R (2005) Cross-selling sequentially ordered products: an application to consumer banking services. J Mark Res 42(2): 233–239
Liu H, Lin Y, Han J (2009) Methods for mining frequent items in data streams: an overview. Knowl Inf Syst (Online First)
Papapetrou P, Kollios G, Sclaroff S et al (2009) Mining frequent arrangements of temporal intervals. Knowl Inf Syst 21(2): 133–171
Park J, Chen M, Yu P (1995) An effective hash based algorithm for mining association rules. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 175–186
Poel D, Schamphelaere J, Wets G (2004) Direct and indirect effects of retail promotions on sales and profits in the do-it-yourself market. Expert Syst Appl 27(1): 53–62
Seetharaman P, Chib S, Ainslie A et al (2005) Models of multi-category choice behavior. Mark Lett 16(3–4): 239–254
Vindevogel B, Poel D, Wets G (2005) Why promotion strategies based on market basket analysis do not work. Expert Syst Appl 28(3): 583–590
Wang K, Su M (2002) Item selection by “hub-authority” profit ranking. In: Proceedings of the eighth ACM SIGKDD, pp 652–657
Wong R, Fu A, Wang K (2005) Data mining for inventory item selection with cross-selling considerations. Data Min Knowl Discov 11: 81–112
Wong R, Fu A, Wang K (2003) MPIS: Maximal-profit item selection with cross-selling considerations. In: Proceedings of ICDM, pp 371–378
Zaki M, Parthasarathy S, Ogihara M et al (1997) New algorithms for fast discovery of association rules. In Proceedings of the third international conference on knowledge discovery and data mining, pp 283–286
Acknowledgments
This research is partly supported by the National Natural Science Foundation of China through grants 90924302 and 70890084, and the Ministry of Science and Technology of China through grant 2006AA010106.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Yang, Y., Hao, C. Product selection for promotion planning. Knowl Inf Syst 29, 223–236 (2011). https://doi.org/10.1007/s10115-010-0326-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-010-0326-8