Size-reducing RBF networks

Junichi Murata, Shinji Itoh, Kotaro Hirasawa

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

In this paper, a new approach is proposed to reduce the complexity of radial basis function (RBF) networks. This approach starts with an enough number of hidden nodes and reduces the number of nodes in the course of learning. The algorithm can be employed in the problems where only the performance index of the network output is given, as well as in the supervised training problems where the desired output values are available. Also, it is applicable to either of classification problems and function approximation problems.

Original languageEnglish
Pages1308-1312
Number of pages5
Publication statusPublished - Dec 1 1999
EventInternational Joint Conference on Neural Networks (IJCNN'99) - Washington, DC, USA
Duration: Jul 10 1999Jul 16 1999

Other

OtherInternational Joint Conference on Neural Networks (IJCNN'99)
CityWashington, DC, USA
Period7/10/997/16/99

Fingerprint

Radial basis function networks

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Murata, J., Itoh, S., & Hirasawa, K. (1999). Size-reducing RBF networks. 1308-1312. Paper presented at International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .

Size-reducing RBF networks. / Murata, Junichi; Itoh, Shinji; Hirasawa, Kotaro.

1999. 1308-1312 Paper presented at International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .

Research output: Contribution to conferencePaper

Murata, J, Itoh, S & Hirasawa, K 1999, 'Size-reducing RBF networks', Paper presented at International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, 7/10/99 - 7/16/99 pp. 1308-1312.
Murata J, Itoh S, Hirasawa K. Size-reducing RBF networks. 1999. Paper presented at International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .
Murata, Junichi ; Itoh, Shinji ; Hirasawa, Kotaro. / Size-reducing RBF networks. Paper presented at International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .5 p.
@conference{3c61f77898d44152a847a03bdf1d6bea,
title = "Size-reducing RBF networks",
abstract = "In this paper, a new approach is proposed to reduce the complexity of radial basis function (RBF) networks. This approach starts with an enough number of hidden nodes and reduces the number of nodes in the course of learning. The algorithm can be employed in the problems where only the performance index of the network output is given, as well as in the supervised training problems where the desired output values are available. Also, it is applicable to either of classification problems and function approximation problems.",
author = "Junichi Murata and Shinji Itoh and Kotaro Hirasawa",
year = "1999",
month = "12",
day = "1",
language = "English",
pages = "1308--1312",
note = "International Joint Conference on Neural Networks (IJCNN'99) ; Conference date: 10-07-1999 Through 16-07-1999",

}

TY - CONF

T1 - Size-reducing RBF networks

AU - Murata, Junichi

AU - Itoh, Shinji

AU - Hirasawa, Kotaro

PY - 1999/12/1

Y1 - 1999/12/1

N2 - In this paper, a new approach is proposed to reduce the complexity of radial basis function (RBF) networks. This approach starts with an enough number of hidden nodes and reduces the number of nodes in the course of learning. The algorithm can be employed in the problems where only the performance index of the network output is given, as well as in the supervised training problems where the desired output values are available. Also, it is applicable to either of classification problems and function approximation problems.

AB - In this paper, a new approach is proposed to reduce the complexity of radial basis function (RBF) networks. This approach starts with an enough number of hidden nodes and reduces the number of nodes in the course of learning. The algorithm can be employed in the problems where only the performance index of the network output is given, as well as in the supervised training problems where the desired output values are available. Also, it is applicable to either of classification problems and function approximation problems.

UR - http://www.scopus.com/inward/record.url?scp=0033325255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033325255&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0033325255

SP - 1308

EP - 1312

ER -