.png){kind=icon}
返回
Simplex basis function based sparse least squares support vector regression
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2018.11.025.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel sparse least squares support vector regression algorithm, referred to as LSSVR-SBF, is introduced which uses a new low rank kernel based on simplex basis function, which has a set of nonlinear parameters. It is shown that the proposed model can be represented as a sparse linear regression model based on simplex basis functions. We propose a fast algorithm for least squares support vector regression solution at the cost of O (N) by avoiding direct kernel matrix inversion. An iterative estimation algorithm has been proposed to optimize the nonlinear parameters associated with the simplex basis functions with the aim of minimizing model mean square errors using the gradient descent algorithm. The proposed fast least square solution and the gradient descent algorithm are alternatively applied. Finally it is shown that the model has a dual representation as a piecewise linear model with respect to the system input. Numerical experiments are carried out to demonstrate the effectiveness of the proposed approaches. (C) 2018 Published by Elsevier B.V.
Keyword:
Least squares support vector regression
Low rank kernels
Simplex basis function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
On the Development and Applications of Cellulosic Nanofibrillar and Nanocrystalline Materials纤维素纳米原纤和纳米晶材料的发展与应用
PREAI
分享收藏分享收藏Weighted least squares support vector machines: robustness and sparse approximation.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏分享收藏Irredundant lattice lattice representations of continuous piecewise affine functionsAUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容