Input selection for radial basis function networks by constrained optimization

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

Abstract

Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is usually limited. However, the contributions of input variables in the prediction of output would be valuable information in many real world applications. In this work, an input selection algorithm for Radial basis function networks is proposed. The selection of input variables is achieved using a constrained cost function, in which each input dimension is weighted. The constraints are imposed on the values of weights. The proposed algorithm solves a log-barrier reformulation of the original optimization problem. The input selection algorithm was applied to both simulated and benchmark data and obtained results were compelling. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Tikka, J. (2007). Input selection for radial basis function networks by constrained optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4668 LNCS, pp. 239–248). Springer Verlag. https://doi.org/10.1007/978-3-540-74690-4_25

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