পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ARIMA (Autoregressive Integrated Moving Average) মডেল× | গ্রেডিয়েন্ট বুস্টিং× | সাধারণ ন্যূনতম বর্গক্ষেত্র (OLS) রিগ্রেশন× | কোয়ান্টাইল রিগ্রেশন× | |
|---|---|---|---|---|
| ক্ষেত্র≠ | অর্থমিতি | যন্ত্র শিখন | অর্থমিতি | অর্থমিতি |
| পরিবার≠ | Regression model | Machine learning | Regression model | Regression model |
| উদ্ভবের বছর≠ | 2015 | 2001 | 2019 | 1978 |
| প্রবর্তক≠ | Box & Jenkins (Box-Jenkins methodology) | Friedman, J. H. | Wooldridge (textbook treatment); classical least squares | Koenker & Bassett |
| ধরন≠ | Univariate time-series model | Ensemble (sequential boosting of decision trees) | Linear regression | Conditional quantile regression |
| মৌলিক উৎস≠ | 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. DOI ↗ | Wooldridge, J. M. (2019). Introductory Econometrics: A Modern Approach (7th ed.). Cengage Learning. ISBN: 978-1337558860 | Koenker, R. & Bassett, G., Jr. (1978). Regression Quantiles. Econometrica, 46(1), 33-50. DOI ↗ |
| অপর নাম≠ | Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | ordinary least squares, classical linear regression, linear regression, en küçük kareler regresyonu | conditional quantile regression, regression quantiles, Kantil Regresyon |
| সম্পর্কিত | 5 | 5 | 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. | Ordinary Least Squares is the classical linear regression method that explains a continuous outcome as a linear combination of predictors. It estimates the coefficients by minimising the sum of squared residuals, and under the Gauss-Markov assumptions these estimates are the best linear unbiased estimator (BLUE). | Quantile regression models conditional quantiles of an outcome - the median, the 25th or 75th percentile, and so on - rather than the conditional mean that OLS targets. Introduced by Koenker and Bassett in 1978, it reveals how predictors act across the whole distribution, including its tails. |
| ScholarGateডেটাসেট ↗ |
|
|
|
|