Efficient confidence bounds for RBF networks for sparse and high dimensional data

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

Abstract

Artificial Neural Networks have been used for function approximation and pattern recognition in a variety of domains. However, due to its empirical nature, it is difficult to derive an estimate of neural network's accuracy. There are in the literature a number of proposed methods to calculate a measure of confidence to the output of neural networks but in general these approaches require some strong assumptions which are rarely observed in real problems. This paper analyzes and extends the Validity Index Network, a model derived from radial basis function network that calculates the confidence of its outputs, we remove it restrictions in density calculations, specially in high dimensional input spaces, and improve the probability coverage of the prediction levels when the training data have variable density. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Neto, A. R., Roisenberg, M., & Neto, G. S. (2010). Efficient confidence bounds for RBF networks for sparse and high dimensional data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 423–428). https://doi.org/10.1007/978-3-642-15825-4_56

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