article · 2012
Boosting, Recursive Partitioning
Claudio Conversano, Roberta Siciliano, Via Cintia, Monte S. Angelo, I- Napoli
Cited by 0Abstract and details only
Abstract
In recent years, the explosion in computation and information technology allowed to dispose of vast amounts of data. Nowadays, the statistician’s job is to make sense of it all, by extracting important patterns and trends with the aim of understanding what is inside the data. The new challenge of learning from data has been called “statistical learning ” (Hastie et. al, 2001). In this framework, a lot of new tools have been introduced improving the performance of standard supervised methods. We present a combined semiparametric approach to supervised statistical learning problems called Generalized Additive Multi-Mixture Model (GAM-MM, Conversano, 2002). This is a nonlinear regression tool capable to capture the complexity of the data. It has been defined as an additive combination of mixtures of different classifiers (both parametric and nonparametric) associated to each feature, that uses a backfitting-like algorithm for the estimation/prediction of the output of the response variable. In this approach, Bagging (Brieman, 1996) and Boosting (Freund and Shapire, 1996) can be used to estimate the mixing parameters and to train the additive combination of
Cite this paper
Conversano, C., Siciliano, R., Cintia, V., Angelo, M. S., & Napoli, I. (2012). Boosting, Recursive Partitioning.
Conversano, Claudio, et al. “Boosting, Recursive Partitioning.” 2012.
Conversano, Claudio, Roberta Siciliano, Via Cintia, Monte S. Angelo, and I- Napoli. 2012. “Boosting, Recursive Partitioning.”
Conversano, C. et al. (2012) ‘Boosting, Recursive Partitioning’.
@article{conversano2012boosting,
title = {{Boosting, Recursive Partitioning}},
author = {Conversano, Claudio and Siciliano, Roberta and Cintia, Via and Angelo, Monte S. and Napoli, I-},
year = {2012}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.