返回
Low rank updated LS-SVM classifiers for fast variable selection
DOI:10.1016/j.neunet.2007.12.053.png)
摘要
En 中文
Least squares support vector machine (LS-SVM) classifiers are a class of kernel methods whose solution follows from a set of linear equations. In this work we present low rank modifications to the LS-SVM classifiers that are useful for fast and efficient variable selection. The inclusion or removal of a candidate variable can be represented as a low rank modification to the kernel matrix (linear kernel) of the LS-SVM classifier. In this way, the LS-SVM solution can be updated rather than being recomputed, which improves the efficiency of the overall variable selection process. Relevant variables are selected according to a closed form of the leave-one-out (LOO) error estimator, which is obtained as a by-product of the low rank modifications. The proposed approach is applied to several benchmark data sets as well as two microarray data sets. When compared to other related algorithms used for variable selection, simulations applying our approach clearly show a lower computational complexity together with good stability on the generalization error. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
low rank matrix modifications
least-squares support vector machines
leave-one-out error
variable selection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.9K
被引数:
3.0W
机构
引用论文
Fast exact leave-one-out cross-validation of sparse least-squares support vector machines稀疏最小二乘支持向量机的快速精确留一交叉验证
NEURAL NETWORKS
IF6.3
Gene selection for cancer classification using support vector machines使用支持向量机进行癌症分类的基因选择
MACHINE LEARNING
IF2.9

