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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Leonard, J.A., Kramer, M.A., Ungar, L.H.: A neural network architeture that compute its own reliability. In: Computers Chem. Engng. (1992)
Chryssolouris, G., Lee, M., Ramsey, A.: Confidence interval prediction for neural network models. IEEE Trans. Neural Networks 7, 229–232 (1996)
Shao, R., Martin, E.B., Zhang, J., Morris, A.J.: Confidence bounds for neural network representations. Computers Chem. Engng. 21, 1173–1178 (1997)
Veaux, R.D., Schweinsberg, J., Shellington, D.: Prediction intervals for neural networks via nonlinear regression. Computers Chem. Engng. 21, 1173–1178 (1998)
Hwang, J.T.G., Ding, A.A.: Prediction intervals for artificial neural networks. J. American Statistical Association 92(438), 748–757 (1997)
Yang, L., Kavli, T., Carlin, M., Clausen, S., de Groot, P.: An evaluation of confidence bound estimation methods for neural networks. In: ESIT 2000 (1991)
Wedding, D.K., Cios, K.J.: Cetainty factors versus pazen windows as reliability measures in rbf networks. Neurocomputing 19, 151–165 (1997)
Parzen, E.: On estimation of a probability density function and mode ann. Math. Statist. 33, 1065–1076 (1962)
Bishop, C.M.: Novelty detection and neural network validation. In: IEE Proc.-Vis. Image Signal Process., vol. 141 (1994)
Holmstrom, L., Hamalainen, A.: The self-organizing reduced kernel density estimator. In: IEEE International Conference on Neural Networks, pp. 417–421 (1993)
Bishop, C.M.: Neural Netowrks for Pattern Recognition. Oxford Press, Oxford (1995)
Prechelt, L., Informatik, F.F.: Proben1 - a set of neural network benchmark problems and benchmarking rules. Technical report (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neto, A.R., Roisenberg, M., Neto, G.S. (2010). Efficient Confidence Bounds for RBF Networks for Sparse and High Dimensional Data. In: Diamantaras, K., Duch, W., Iliadis, L.S. (eds) Artificial Neural Networks – ICANN 2010. ICANN 2010. Lecture Notes in Computer Science, vol 6354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15825-4_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-15825-4_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15824-7
Online ISBN: 978-3-642-15825-4
eBook Packages: Computer ScienceComputer Science (R0)