Published in

Elsevier, Neural Networks, 7(20), p. 791-798

DOI: 10.1016/j.neunet.2007.03.001

Links

Tools

Export citation

Search in Google Scholar

Significant vector learning to construct sparse kernel regression models

Journal article published in 2007 by Junbin Gao ORCID, Daming Shi, Xiaomao Liu
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

A novel significant vector (SV) regression algorithm is proposed in this paper based on an analysis of Chen's orthogonal least squares (OLS) regression algorithm. The proposed regularized SV algorithm finds the significant vectors in a successive greedy process in which, compared to the classical OLS algorithm, the orthogonalization has been removed from the algorithm. The performance of the proposed algorithm is comparable to the OLS algorithm while it saves a lot of time complexities in implementing the orthogonalization needed in the OLS algorithm.