পদ্ধতির তুলনা করুন

	ARIMA (Autoregressive Integrated Moving Average) মডেল	গ্রেডিয়েন্ট বুস্টিং
ক্ষেত্র	অর্থমিতি	যন্ত্র শিখন
পরিবার	Regression model	Machine learning
উদ্ভবের বছর	2015	2001
প্রবর্তক	Box & Jenkins (Box-Jenkins methodology)	Friedman, J. H.
ধরন	Univariate time-series model	Ensemble (sequential boosting of decision trees)
মৌলিক উৎস	Box, G. E. P., Jenkins, G. M., Reinsel, G. C. & Ljung, G. M. (2015). Time Series Analysis: Forecasting and Control (5th ed.). Wiley. ISBN: 978-1118675021	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
অপর নাম	Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
সম্পর্কিত	5	5
সারসংক্ষেপ	ARIMA is a univariate time-series forecasting model that combines autoregressive, integrated (differencing), and moving-average components to predict a single continuous series from its own past. It is the centrepiece of the Box-Jenkins methodology set out in Box, Jenkins, Reinsel & Ljung's Time Series Analysis (5th ed., 2015).	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.