In this study, we extend a minimal resource-allocating network (MRAN) which is an on-line learning system for Gaussian radial basis function networks (GRBFs) with growing and pruning strategies so as to realize dimension selection and low computational complexity. We demonstrate that the proposed algorithm outperforms conventional algorithms in terms of both accuracy and computational complexity via some experiments. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Nishida, K., Yamauchi, K., & Omori, T. (2004). An on-line learning algorithm with dimension selection using minimal hyper basis function networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3316, 502–507. https://doi.org/10.1007/978-3-540-30499-9_77
Mendeley helps you to discover research relevant for your work.