Ridgelet kernel regression

19Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A ridgelet kernel regression method is presented in this paper to approximate multi-dimensional functions, especially those with certain kinds of spatial inhomogeneities. This method is based on ridgelet theory, kernel and regularization techniques from which we can deduce a regularized kernel regression form. By representing this form with quadratic programming and taking the obtained solution to define a fitness function, we use particle swarm optimization to optimize the directions of ridgelets. The properties of ridgelet can guarantee the stability of this method in approximating multi-dimensional functions, as well as its superiority for functions with linear singularities. Additionally, the regularized technique employed in this model leads to smaller generalization error. Experiments in the tasks of regression and classification show its effectiveness. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Yang, S., Wang, M., & Jiao, L. (2007). Ridgelet kernel regression. Neurocomputing, 70(16–18), 3046–3055. https://doi.org/10.1016/j.neucom.2006.05.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free