Back to Search Start Over

Analysis of SVM regression bounds for variable ranking

Authors :
Rakotomamonjy, A.
Source :
Neurocomputing. Mar2007, Vol. 70 Issue 7-9, p1489-1501. 13p.
Publication Year :
2007

Abstract

This paper addresses the problem of variable ranking for support vector regression. The ranking criteria that we proposed are based on leave-one-out bounds and some variants and for these criteria we have compared different search-space algorithms: recursive feature elimination and scaling factor optimization based on gradient-descent. All these algorithms have been compared on toy problems and real-world QSAR data sets. Results show that the radius-margin criterion is the most efficient criterion for ranking variables. Using this criterion can then lead to support vector regressor with improved error rate while using fewer variables. Our results also support the evidence that gradient-descent algorithm achieves a better variable ranking compared to backward algorithm. [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
09252312
Volume :
70
Issue :
7-9
Database :
Academic Search Index
Journal :
Neurocomputing
Publication Type :
Academic Journal
Accession number :
24300999
Full Text :
https://doi.org/10.1016/j.neucom.2006.03.016