WEKO3
インデックスリンク
アイテム
{"_buckets": {"deposit": "0e63c407-c462-4e48-9316-8a2fc7520d59"}, "_deposit": {"created_by": 3, "id": "7597", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "7597"}, "status": "published"}, "_oai": {"id": "oai:kanazawa-u.repo.nii.ac.jp:00007597", "sets": ["936"]}, "author_link": ["353", "10168"], "item_8_biblio_info_8": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2006-01-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "3400", "bibliographicPageStart": "3395", "bibliographic_titles": [{"bibliographic_title": "IEEE International Conference on Neural Networks - Conference Proceedings"}]}]}, "item_8_description_21": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "OveOver 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.", "subitem_description_type": "Abstract"}]}, "item_8_description_5": {"attribute_name": "提供者所属", "attribute_value_mlt": [{"subitem_description": "金沢大学大学院理工研究域電子情報学系", "subitem_description_type": "Other"}]}, "item_8_publisher_17": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electrical and Electronics Engineers (IEEE)"}]}, "item_8_relation_27": {"attribute_name": "シリーズ", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "1716563"}]}]}, "item_8_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1098-7576", "subitem_source_identifier_type": "ISSN"}]}, "item_8_version_type_25": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Jansen, Boris"}], "nameIdentifiers": [{"nameIdentifier": "10168", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nakayama, Kenji"}], "nameIdentifiers": [{"nameIdentifier": "353", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "00207945", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=00207945"}, {"nameIdentifier": "00207945", "nameIdentifierScheme": "研究者番号", "nameIdentifierURI": "https://nrid.nii.ac.jp/nrid/1000000207945"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-10-03"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "TE-PR-NAKAYAMA-K-3395.pdf", "filesize": [{"value": "191.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 191900.0, "url": {"label": "TE-PR-NAKAYAMA-K-3395.pdf", "url": "https://kanazawa-u.repo.nii.ac.jp/record/7597/files/TE-PR-NAKAYAMA-K-3395.pdf"}, "version_id": "dc4f927b-8208-4596-bc82-93114efae2db"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "conference paper", "resourceuri": "http://purl.org/coar/resource_type/c_5794"}]}, "item_title": "An adaptive penalty-based learning extension for backpropagation and its variants", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An adaptive penalty-based learning extension for backpropagation and its variants"}]}, "item_type_id": "8", "owner": "3", "path": ["936"], "permalink_uri": "http://hdl.handle.net/2297/9777", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-10-03"}, "publish_date": "2017-10-03", "publish_status": "0", "recid": "7597", "relation": {}, "relation_version_is_last": true, "title": ["An adaptive penalty-based learning extension for backpropagation and its variants"], "weko_shared_id": -1}
An adaptive penalty-based learning extension for backpropagation and its variants
http://hdl.handle.net/2297/9777
http://hdl.handle.net/2297/9777bae23d53-acb3-4c93-955f-1e3816b1ea06
名前 / ファイル | ライセンス | アクション |
---|---|---|
TE-PR-NAKAYAMA-K-3395.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 | |||||
著者 |
Jansen, Boris
× Jansen, Boris× Nakayama, Kenji |
|||||
提供者所属 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 金沢大学大学院理工研究域電子情報学系 | |||||
書誌情報 |
IEEE International Conference on Neural Networks - Conference Proceedings p. 3395-3400, 発行日 2006-01-01 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1098-7576 | |||||
出版者 | ||||||
出版者 | Institute of Electrical and Electronics Engineers (IEEE) | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | OveOver 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 |