Abstract
The Dynamic Decay Adjustment (DDA) algorithm is a fast constructive algorithm for training RBF neural networks for classification tasks. In a previous work, we have proposed a method for improving RBF-DDA generalization performance by adequately selecting the value of one of its training parameters (θ − −). Unfortunately, this method generates much larger networks than RBF-DDA with default parameters. This paper proposes a method for improving RBF-DDA generalization performance by combining a data reduction technique with the parameter selection technique. The proposed method has been evaluated on four classification tasks from the UCI repository, including three optical character recognition datasets. The results obtained show that the proposed method considerably improves performance of RBF-DDA without producing larger networks. The results are compared to MLP and k-NN results obtained in previous works. It is shown that the method proposed in this paper outperforms MLPs and obtains results comparable to k-NN on these tasks.
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.
References
Berthold, M., Diamond, J.: Constructive training of probabilistic neural networks. Neurocomputing 19, 167–183 (1998)
Berthold, M.R., Diamond, J.: Boosting the performance of RBF networks with dynamic decay adjustment. In: Tesauro, G., et al. (eds.) Advances in Neural Information Processing, vol. 7. MIT Press, Cambridge (1955)
Blake, C., Merz, C.: UCI repository of machine learning databases (1998), Available from, http://www.ics.uci.edu/~mlearn/MLRepository.html
Frey, P.W., Slate, D.J.: Letter recognition using holland-style adaptive classi- fiers. Machine Learning 6(2) (March 1991)
Kaynak, C., Alpaydin, E.: Multistage cascading of multiple classifiers: One man’s noise in another man’s data. In: Proc. of the 17th International Conference on Machine Learning (2000)
Kumar, S., Ghosh, J., Crawford, M.: A bayesian pairwise classifier for character recognition. In: Mursheed, N. (ed.) Cognitive and Neural Models for Word Recognition and Document Processing. World Scientific Press, Singapore (2000)
Michie, D., Spiegelhalter, D.J., Taylor, C.C. (eds.): Machine Learning, Neural and Statistical Classification. Ellis Horwood (1994)
Oliveira, A.L.I., Neto, F.B.L., Meira, S.R.L.: Improving RBF-DDA performance on optical character recognition through parameter selection. In: Proc. of the 17th International Conference on Pattern Recognition (ICPR 2004), Cambridge, UK, vol. 4, pp. 625–628. IEEE Computer Society Press, Los Alamitos (2004), see http://csdl.computer.org/comp/proceedings/icpr/2004/2128/04/212840625abs.htm
Ou, Y.-Y., Chen, C.-Y., Hwang, S.-C., Oyang, Y.-J.: Expediting model selection for support vector machines based on data reduction. In: Proc. of IEEE Conference on Systems, Man and Cybernetics (2003)
Wang, J., Neskovic, P., Cooper, L.N.: Partitioning a feature space using a locally defined confidence measure. In: Kaynak, O., Alpaydın, E., Oja, E., Xu, L. (eds.) ICANN 2003 and ICONIP 2003. LNCS, vol. 2714. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, A.L.I., Melo, B.J.M., Neto, F.B.L., Meira, S.R.L. (2004). Combining Data Reduction and Parameter Selection for Improving RBF-DDA Performance. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_78
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive