Size-reducing RBF networks

Junichi Murata, Shinji Itoh, Kotaro Hirasawa

研究成果: 会議への寄与タイプ論文

1 引用 (Scopus)

抄録

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.

元の言語英語
ページ1308-1312
ページ数5
出版物ステータス出版済み - 12 1 1999
イベントInternational Joint Conference on Neural Networks (IJCNN'99) - Washington, DC, USA
継続期間: 7 10 19997 16 1999

その他

その他International Joint Conference on Neural Networks (IJCNN'99)
Washington, DC, USA
期間7/10/997/16/99

Fingerprint

Radial basis function networks

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

これを引用

Murata, J., Itoh, S., & Hirasawa, K. (1999). Size-reducing RBF networks. 1308-1312. 論文発表場所 International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .

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

1999. 1308-1312 論文発表場所 International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .

研究成果: 会議への寄与タイプ論文

Murata, J, Itoh, S & Hirasawa, K 1999, 'Size-reducing RBF networks' 論文発表場所 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. 論文発表場所 International Joint Conference on Neural Networks (IJCNN'99), Washington, DC, USA, .
Murata, Junichi ; Itoh, Shinji ; Hirasawa, Kotaro. / Size-reducing RBF networks. 論文発表場所 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

SP - 1308

EP - 1312

ER -