Boosting Ridge Regression for High Dimensional Data Classification
Preprint
Abstract
Ridge regression is a well established regression estimator which can conveniently be adapted for classification problems. One compelling reason is probably the fact that ridge regression emits a closed-form solution thereby facilitating the training phase. However in the case of high-dimensional problems, the closed-form solution which involves inverting the regularised covariance matrix is rather expensive to compute. The high computational demand of such operation also renders difficulty in constructing ensemble of ridge regressions. In this paper, we consider learning an ensemble of ridge regressors where each regressor is trained in its own randomly projected subspace. Subspace regressors are later combined via adaptive boosting methodology. Experiments based on five high-dimensional classification problems demonstrated the effectiveness of the proposed method in terms of learning time and in some cases improved predictive performance can be observed.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Spectral and Spatial Classification of Hyperspectral Images Based on Random Multi-GraphsRemote Sensing, 2018
- High dimensional data classification and feature selection using support vector machinesEuropean Journal of Operational Research, 2018
- Label-Noise Robust Logistic Regression and Its ApplicationsLecture Notes in Computer Science, 2012
- Approaches to working in high-dimensional data spaces: gene expression microarraysBritish Journal of Cancer, 2008
- Boosting ridge regressionComputational Statistics & Data Analysis, 2007
- Predicting the clinical status of human breast cancer by using gene expression profilesProceedings of the National Academy of Sciences, 2001
- Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression MonitoringScience, 1999