Market Segmentation Trees

References

• Aghaei S, Azizi MJ, Vayanos P (2019) Learning optimal and fair decision trees for non-discriminative decision-making. Proc. Conf. AAAI Artificial Intelligence, vol.33, 1418–1426.Crossref, Google Scholar
• Baardman L, Levin I, Perakis G, Singhvi D (2017) Leveraging comparables for new product sales forecasting. Preprint, submitted December 11, https://dx.doi.org/10.2139/ssrn.3086237.Google Scholar
• Bernstein F, Modaresi S, Sauré D (2019) A dynamic clustering approach to data-driven assortment personalization. Management Sci. 65(5):2095–2115.Abstract, Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, Dunn J, Mundru N (2019) Optimal prescriptive trees. INFORMS J. Optim. 1(2):164–183.Link, Google Scholar
• Bertsimas D, Orfanoudaki A, Wiberg H (2021) Interpretable clustering: An optimization approach. Machine Learn. 110(1):89–138.Crossref, Google Scholar
• Bierlaire M, Axhausen K, Abay G (2001) The acceptance of modal innovation: The case of swissmetro. Proc. Swiss Transport Res. Conf.Google Scholar
• Biggs M, Hariss R, Perakis G (2017) Optimizing objective functions determined from random forests. Preprint, submitted June 16, https://dx.doi.org/10.2139/ssrn.2986630.Google Scholar
• Blockeel H, De Raedt L, Ramon J (2000) Top-down induction of clustering trees. Preprint, submitted November 21, https://arxiv.org/abs/cs/0011032.Google Scholar
• Breiman L, Friedman JH, Olshen RA, Stone CJ (2017) Classification and Regression Trees (Routledge, Abingdon, UK).Crossref, Google Scholar
• Bruckner AM, Ostrow E (1962) Some function classes related to the class of convex functions. Pacific J. Math. 12(4):1203–1215.Crossref, Google Scholar
• Brunk HD (1970) Estimation of isotonic regression. Nonparametric Techniques in Statistical Inference (Cambridge University Press, Cambridge, UK), 195.Google Scholar
• Carrizosa E, Molero-Río C, Morales DR (2021) Mathematical optimization in classification and regression trees. TOP 29(1):5–33.Crossref, Google Scholar
• Chan K-Y, Loh W-Y (2004) Lotus: An algorithm for building accurate and comprehensible logistic regression trees. J. Comput. Graphical Statist. 13(4):826–852.Crossref, Google Scholar
• Chen N, Gallego G, Tang Z (2019) The use of binary choice forests to model and estimate discrete choices. Preprint, submitted August 3, https://arxiv.org/abs/1908.01109.Google Scholar
• Chen Y-C, Mišić VV (2022) Decision forest: A nonparametric approach to modeling irrational choice. Management Sci. 68(10):7090–7111.Google Scholar
• Ciocan DF, Mišić VV (2022) Interpretable optimal stopping. Management Sci. 68(3):1616–1638.Link, Google Scholar
• Cui R, Gallino S, Moreno A, Zhang DJ (2018) The operational value of social media information. Production Oper. Management 27(10):1749–1769.Crossref, Google Scholar
• Elmachtoub A, Jason CNL, McNellis R (2020) Decision trees for decision-making under the predict-then-optimize framework. Internat. Conf. on Machine Learn., 2858–2867.Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize.” Management Sci. 68(1):9–26.Link, Google Scholar
• Elmachtoub AN, Gupta V, Hamilton ML (2021) The value of personalized pricing. Management Sci. 67(10):6055–6070.Link, Google Scholar
• Elmachtoub AN, McNellis R, Oh S, Petrik M (2017) A practical method for solving contextual bandit problems using decision trees. Elidan G, Kersting K, Ihler AT eds. Proc. 33rd Conf. on Uncertainty in Artificial Intelligence (AUAI Press).Google Scholar
• Ferreira KJ, Bin HAL, Simchi-Levi D (2016) Analytics for an online retailer: Demand forecasting and price optimization. Manufacturing Service Oper. Management 18(1):69–88.Link, Google Scholar
• Fraiman R, Ghattas B, Svarc M (2013) Interpretable clustering using unsupervised binary trees. Adv. Data Anal. Classification 7(2):125–145.Crossref, Google Scholar
• Friedman J, Hastie T, Tibshirani R (2001) The Elements of Statistical Learning, vol. 1. Springer Series in Statistics (Springer, Berlin).Google Scholar
• Glaeser CK, Fisher M, Su X (2019) Optimal retail location: Empirical methodology and application to practice. Manufacturing Service Oper. Management 21(1):86–102.Link, Google Scholar
• Goodman B, Flaxman S (2017) European Union regulations on algorithmic decision-making and a “right to explanation.” AI Magazine 38(3):50–57.Crossref, Google Scholar
• Han Y, Zegras C, Pereira FC, Ben-Akiva M (2020) A neural-embedded choice model: TasteNet-MNL modeling taste heterogeneity with flexibility and interpretability. Preprint, submitted February 3, https://arxiv.org/abs/2002.00922.Google Scholar
• Hanson DL, Pledger G, Wright FT (1973) On consistency in monotonic regression. Ann. Statist. 1(3):401–421.Crossref, Google Scholar
• Jagabathula S, Subramanian L, Venkataraman A (2018) A model-based embedding technique for segmenting customers. Oper. Res. 66(5):1247–1267.Link, Google Scholar
• Jagabathula S, Subramanian L, Venkataraman A (2020) A conditional gradient approach for nonparametric estimation of mixing distributions. Management Sci. 66(8):3635–3656.Link, Google Scholar
• JéJé J (1992) An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA).Google Scholar
• Kallus N (2017) Recursive partitioning for personalization using observational data. Proc. 34th Internat. Conf. on Machine Learn., vol. 70., 1789–1798.Google Scholar
• Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper. Res. 68(4):1020–1037.Link, Google Scholar
• Kamakura WA, Russell GJ (1989) A probabilistic choice model for market segmentation and elasticity structure. J. Marketing Res. 26(4):379–390.Crossref, Google Scholar
• Landwehr N, Hall M, Frank E (2005) Logistic model trees. Machine Learn. 59(1–2):161–205.Crossref, Google Scholar
• Laurent H, Rivest RL (1976) Constructing optimal binary decision trees is NP-complete. Inform. Processing Lett. 5(1):15–17.Crossref, Google Scholar
• Lemmens A, Croux C (2006) Bagging and boosting classification trees to predict churn. J. Marketing Res. 43(2):276–286.Crossref, Google Scholar
• Mišić VV (2016) Data, models and decisions for large-scale stochastic optimization problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Mišić VV (2020) Optimization of tree ensembles. Oper. Res. 68(5):1605–1624.Link, Google Scholar
• Nambiar M, Simchi-Levi D, Wang H (2019) Dynamic learning and pricing with model misspecification. Management Sci. 65(11):4980–5000.Link, Google Scholar
• Quinlan JR (1992) Learning with continuous classes. Proc. 5th Australian Joint Conf. on Artificial Intelligence, vol. 92 (World Scientific, Singapore), 343–348.Google Scholar
• Rudin C (2019) Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Natural Machine Intelligence 1(5):206–215.Crossref, Google Scholar
• Sluis S (2019) Google switches to first-price auction. Accessed March 9, 2021, https://adexchanger.com/online-advertising/google-switches-to-first-price-auction/.Google Scholar
• Train KE (2009) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Tuma MN, Decker R, Scholz SW (2011) A survey of the challenges and pitfalls of cluster analysis application in market segmentation. Internat. J. Marketing Res. 53(3):391–414.Google Scholar
• Yang J, Liu C, Teng M, Liao M, Xiong H (2016) Buyer targeting optimization: A unified customer segmentation perspective. Proc. IEEE Internat. Conf. on Big Data (IEEE, New York), 1262–1271.Google Scholar
• Yoganarasimhan H (2020) Search personalization using machine learning. Management Sci. 66(3):1045–1070.Link, Google Scholar
• Zeileis A, Hothorn T, Hornik K (2008) Model-based recursive partitioning. J. Comput. Graphical Statist. 17(2):492–514.Crossref, Google Scholar