By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. Nishida ; Graduate Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo, Japan ; K. Yamauchi ; T. Omori

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.

Published in:

SICE 2004 Annual Conference  (Volume:3 )

Date of Conference:

4-6 Aug. 2004