Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| Kettősen robusztus becslés (AIPW)× | Véletlen erdő× | |
|---|---|---|
| Tudományterület≠ | Oksági következtetés | Gépi tanulás |
| Módszercsalád≠ | Regression model | Machine learning |
| Keletkezés éve≠ | 2005 | 2001 |
| Megalkotó≠ | Robins & Rotnitzky; Bang & Robins | Breiman, L. |
| Típus≠ | Semiparametric causal estimator | Ensemble (bagging of decision trees) |
| Alapmű≠ | Robins, J. M. & Rotnitzky, A. (1995). Semiparametric Efficiency in Multivariate Regression Models with Missing Data. Journal of the American Statistical Association, 90(429), 122-129. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alternatív nevek | AIPW, augmented inverse probability weighting, doubly robust estimator, Çift Gürbüz Kestirici (Augmented IPW / AIPW) | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Kapcsolódó≠ | 5 | 4 |
| Összefoglaló≠ | Doubly Robust Estimation, also called Augmented Inverse Probability Weighting (AIPW), is a semiparametric method for estimating causal treatment effects that combines an outcome regression model with a propensity (treatment) model. Developed in the work of Robins & Rotnitzky (1995) and Bang & Robins (2005), it stays consistent as long as at least one of the two models is correctly specified. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateAdatkészlet ↗ |
|
|