Ensembles of Least Squares Classifiers with Randomized Kernels
| Autor: | Kari Torkkola, Eugene Tuv |
|---|---|
| Rok vydání: | 2008 |
| Předmět: | |
| Zdroj: | Data Mining: Foundations and Practice ISBN: 9783540784876 Data Mining: Foundations and Practice |
| DOI: | 10.1007/978-3-540-78488-3_22 |
| Popis: | For the recent NIPS-2003 feature selection challenge we studied ensembles of regularized least squares classifiers (RLSC). We showed that stochastic ensembles of simple least squares kernel classifiers give the same level of accuracy as the best single RLSC. Results achieved were ranked among the best at the challenge. We also showed that performance of a single RLSC is much more sensitive to the choice of kernel width than that of an ensemble. As a continuation of this work we demonstrate that stochastic ensembles of least squares classifiers with randomized kernel widths and OOB-post-processing often outperform the best single RLSC, and require practically no parameter tuning. We used the same set of very high dimensional classification problems presented at the NIPS challenge. Fast exploratory Random Forests were applied for variable filtering first. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|