Abstract
This chapter explores tree-based methods for demand prediction. These methods are widely used given their strong predictive power. We consider three types of methods: Decision Tree, Random Forest, and Gradient Boosted Tree. We apply these methods under both the centralized and decentralized approaches. For each method, we briefly discuss the underlying mathematical framework, present a common practical way to select the parameters, and detail the implementation process by providing the appropriate codes. We conclude by comparing the different methods in terms of both prediction accuracy and running time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Bergstra, J. and Bengio, Y., 2012. Random search for hyper-parameter optimization. Journal of machine learning research, 13(2).
Chen, T., Guestrin, C., 2016, XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 785–794).
Hastie, T., Tibshirani, R. and Friedman, J., 2009. The elements of statistical learning: data mining, inference, and prediction. Springer Science & Business Media.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Cohen, M.C., Gras, PE., Pentecoste, A., Zhang, R. (2022). Tree-Based Methods. In: Demand Prediction in Retail . Springer Series in Supply Chain Management, vol 14. Springer, Cham. https://doi.org/10.1007/978-3-030-85855-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-85855-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85854-4
Online ISBN: 978-3-030-85855-1
eBook Packages: Business and ManagementBusiness and Management (R0)