An online learning algorithm with dimension selection using minimal hyper basis function networks

In this study, we extend a minimal resource-allocating network (MRAN) which is an online 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.