ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. B. 理工学域; 数物科学類・物質化学類・機械工学類・フロンティア工学類・電子情報通信学類・地球社会基盤学類・生命理工学類
  2. b 10. 学術雑誌掲載論文
  3. 1.査読済論文(工)

An adaptive penalty-based learning extension for backpropagation and its variants

http://hdl.handle.net/2297/18164
http://hdl.handle.net/2297/18164
4347460f-8669-4f36-a972-b5371e272d7d
名前 / ファイル ライセンス アクション
TE-PR-NAKAYAMA-K-6427.pdf TE-PR-NAKAYAMA-K-6427.pdf (191.9 kB)
Item type 会議発表論文 / Conference Paper(1)
公開日 2017-10-03
タイトル
タイトル An adaptive penalty-based learning extension for backpropagation and its variants
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_5794
資源タイプ conference paper
著者 Boris, Jansen

× Boris, Jansen

WEKO 10911

Boris, Jansen

ja-Kana ナカヤマ, ケンジ

Search repository
Nakayama, Kenji

× Nakayama, Kenji

WEKO 353
e-Rad 00207945
研究者番号 00207945

Nakayama, Kenji

Search repository
提供者所属
内容記述タイプ Other
内容記述 金沢大学理工研究域 電子情報学系
書誌情報 IEEE International Conference on Neural Networks - Conference Proceedings

p. 6427-6432, 発行日 2006-07-01
出版者
出版者 IEEE = Institute of Electrical and Electronics Engineers
抄録
内容記述タイプ Abstract
内容記述 Over the years, many improvements and refinements of the backpropagation learning algorithm have been reported. In this paper, a new adaptive penalty-based learning extension for the backpropagation learning algorithm and its variants is proposed. The new method initially puts pressure on artificial neural networks in order to get all outputs for all training patterns into the correct half of the output range, instead of mainly focusing on minimizing the difference between the target and actual output values. The technique is easy to implement and computationally inexpensive. In this study, the new approach has been applied to the backpropagation learning algorithm as well as the RPROP learning algorithm and simulations have been performed. The superiority of the new proposed method is demonstrated. By applying the extension, the number of successful runs can be greatly increased and the average number of epochs to convergence can be well reduced on various problem instances. Furthermore, the change of the penalty values during training has been studied and its observation shows the active role the penalties play within the learning process. © 2006 IEEE.
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
シリーズ
関連名称 1716563
戻る
0
views
See details
Views

Versions

Ver.1 2023-07-28 02:17:11.511535
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3