A Data Mining-Based Framework for Multi-item Markdown Optimization

Chapter
Part of the Springer Series in Fashion Business book series (SSFB)

Abstract

Markdown decisions in retailing are made based on the demand forecasts which may or may not be accurate in the first place. In this chapter, we propose a framework for forecasting weekly demands of retail items via linear regression models within multi-item groups that incorporate both positive and negative item associations. We then utilize dynamic pricing models to optimize markdown decisions based on the forecasts within multi-item groups. Grouping items can be considered as a form of variable selection to prevent the overfitting in prediction models. We report regression results from multi-item groupings besides results from single-item regression model on a real-world dataset provided by an apparel retailer. We then report markdown optimization results for the single items and multi-item groupings that multi-item forecasting models are built upon. The results show that the regression models provide better estimates within multi-item groups compared to the single-item model. Moreover, the overall revenues achieved in multi-item markdown optimization across all grouping schemes are higher than the total revenue yielded by single-item markdown optimization scheme.

References

  1. Basu S, Davidson I, Wagstaff KL (eds) (2008) Constrained clustering: advances in algorithms, theory, and applications. Chapman and Hall/CRCGoogle Scholar
  2. Bradley PS, Mangasarian OL, Street WN (1997) Clustering via concave minimization. In: Mozer MC, Jordan MI, Petsche T (eds) Advances in neural information processing systems. MIT Press, Cambridge, MA, pp 368–374. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-03.ps.Z
  3. Bunn DW, Vassilopoulos AI (1999) Comparison of seasonal estimation methods in multi-item short-term forecasting. Int J Forecast 15(4):431–443CrossRefGoogle Scholar
  4. Cosgun O, Kula U, Kahraman C (2013) Markdown optimization via approximate dynamic programming. Int J Comput Intell Syst 6(1):64–78CrossRefGoogle Scholar
  5. de Menezes LM, Bunn DW, Taylor JW (2000) Review of guidelines for the use of combined forecasts. Eur J Oper Res 120(1):190–204CrossRefGoogle Scholar
  6. Dekimpe MG, Hanssens DM (2000) Time-series models in marketing: past, present and future. Int J Res Mark 17:183–193CrossRefGoogle Scholar
  7. Dekker M, van Donselaar K, Ouwehand P (2004) How to use aggregation and combined forecasting to improve seasonal demand forecasts. Int J Prod Econ 90:151–167CrossRefGoogle Scholar
  8. Demiriz A (2015) Using pairwise associations for multi-item markdown optimisation. Int J Syst Sci Oper Logist 1–14. https://doi.org/10.1080/23302674.2015.1094835
  9. Demiriz A, Cihan A, Kula U (2009) Analyzing price data to determine positive and negative product associations. In: Leung C, Lee M, Chan J (eds) Neural information processing. LNCS, vol 5863. Springer, pp 846–855CrossRefGoogle Scholar
  10. Demiriz A, Ertek G, Atan T, Kula U (2011) Re-mining item associations: methodology and a case study in apparel retailing. Decis Support Syst 52(1):284–293CrossRefGoogle Scholar
  11. Demiriz A, Ekizoglu B, Kula U (2010a) Clustering products under pairwise positive and negative association constraints in retailing. In: Proceedings of ANNIE 2010, St. Louis, MO, USA, November, 2010Google Scholar
  12. Demiriz A, Ertek G, Atan T, Kula U (2010b) Re-mining positive and negative association mining results. In: Perner P (ed) Advances in data mining. applications and theoretical aspects, vol 6171 of LNCS. Springer, pp 101–114CrossRefGoogle Scholar
  13. Demiriz A, Bennett KP, Bradley PS (2018) Using assignment constraints to avoid empty clusters in k-means clustering. In: Basu et al (eds) [1], pp 203–222Google Scholar
  14. Fisher M, Gallino S, Li J (2015) Competition-based dynamic pricing in online retailing: a methodology validated with field experiments. Technical report, Ross School of Business, University of Michigan, January 2015Google Scholar
  15. Fu T (2011) A review on time series data mining. Eng Appl Artif Intell 24(1):164–181CrossRefGoogle Scholar
  16. Gardner ES Jr (2006) Exponential smoothing: the state of the art-Part II. Int J Forecast 22(4):637–666CrossRefGoogle Scholar
  17. Gilpin S, Davidson I (2011) Incorporating sat solvers into hierarchical clustering algorithms: an efficient and flexible approach. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’11, New York, NY, USA, 2011. ACM, pp 1136–1144Google Scholar
  18. Granger CWJ, Ramanathan R (1984) Improved methods of combining forecasts. J Forecast 3(2):197–204CrossRefGoogle Scholar
  19. Gür-Ali Ö, Sayın S, van Woensel T, Fransoo J (2009) SKU demand forecasting in the presence of promotions. Expert Syst Appl 36(10):12340–12348CrossRefGoogle Scholar
  20. Gürhan Kök A, Fisher ML (2007) Demand estimation and assortment optimization under substitution: methodology and application. Oper Res 55(6):1001–1021CrossRefGoogle Scholar
  21. Hasan M, Salem S, Zaki M (2011) SimClus: an effective algorithm for clustering with a lower bound on similarity. Knowl Inf Syst 28:665–685. https://doi.org/10.1007/s10115-010-0360-6CrossRefGoogle Scholar
  22. Johnson K, Lee BHA, Simchi-Levi D (2014) Analytics for an online retailer: demand forecasting and price optimization. Technical report, MITGoogle Scholar
  23. Kumar M, Patel N (2010) Using clustering to improve sales forecasts in retail merchandising. Ann Oper Res 174:33–46. https://doi.org/10.1007/s10479-008-0417-zCrossRefGoogle Scholar
  24. Lange T, Law MH, Jain AK, Buhmann JM (2018) Clustering with constraints: a mean-field approximation perspective. In: Basu et al (eds) [1], pp 91–122Google Scholar
  25. Lu Z, Leen TK (2018) Pairwise constraints as priors in probabilistic clustering. In: Basu et al (eds) [1], pp 59–90CrossRefGoogle Scholar
  26. Nijs VR, Dekimpe MG, Steenkamp J-BEM, Hanssens DM (2001) The category-demand effects of price promotions. Mark Sci 20(1):1–22CrossRefGoogle Scholar
  27. Pensa RG, Robardet C, Boulicaut JF (2018) Constraint-driven co-clustering of 0/1 data. In Basu et al. [1], pp 123–148Google Scholar
  28. Shocker AD, Bayus BL, Namwoon K (2004) Product complements and substitutes in the real world: the relevance of "other products". J Mark 68:28–40CrossRefGoogle Scholar
  29. Shy O (2008) How to price: a guide to pricing techniques and yield management. Cambridge University PressGoogle Scholar
  30. Sung NH, Lee JK (2000) Knowledge assisted dynamic pricing for large-scale retailers. Decis Support Syst 28(4):347–363CrossRefGoogle Scholar
  31. Talluri KT, Van Ryzin G (2004) The theory and practice of revenue management. Springer, International Series in Operations Research & Management ScienceCrossRefGoogle Scholar
  32. Tan P-N, Kumar V, Kuno H (2001) Using SAS for mining indirect associations in data. In: Western Users of SAS software conferenceGoogle Scholar
  33. Thomassey S, Fiordaliso A (2006) A hybrid sales forecasting system based on clustering and decision trees. Decis Support Syst 42(1):408–421CrossRefGoogle Scholar
  34. Vindevogel B, den Poel Van D, Wets G (2005) Why promotion strategies based on market basket analysis do not work. Expert Syst Appl 28(3):583–590CrossRefGoogle Scholar
  35. Wu X, Kumar V, Ross Quinlan J, Ghosh J, Yang Q, Motoda H, McLachlan G, Ng A, Liu B, Yu P, Zhou Z-H, Steinbach M, Hand D, Steinberg D (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14:1–37 (2008). https://doi.org/10.1007/s10115-007-0114-2CrossRefGoogle Scholar
  36. Xie J, Zeng L (2010) Group variable selection methods and their applications in analysis of genomic data. In: Feng J, Fu W, Sun F (eds) Frontiers in computational and systems biology, vol 15. Computational biology. Springer, London, pp 231–248CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Industrial EngineeringGebze Technical UniversityKocaeliTurkey

Personalised recommendations