{"created":"2023-05-15T11:55:47.906290+00:00","id":859,"links":{},"metadata":{"_buckets":{"deposit":"c9a60874-b938-4269-8694-8683d9e1fbd4"},"_deposit":{"created_by":3,"id":"859","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"859"},"status":"published"},"_oai":{"id":"oai:kyutech.repo.nii.ac.jp:00000859","sets":["8:24"]},"author_link":["203"],"control_number":"859","item_1689815586683":{"attribute_name":"CRID","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://cir.nii.ac.jp/crid/1050001338909799040","subitem_relation_type_select":"URI"}}]},"item_21_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-02-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"194","bibliographicPageStart":"184","bibliographicVolumeNumber":"J86-D-2","bibliographic_titles":[{"bibliographic_title":"電子情報通信学会論文誌. D-II, 情報・システム, II-パターン処理","bibliographic_titleLang":"ja"}]}]},"item_21_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"競合連想ネットCAN2は競合ネットと連想ネットの機能を用いて非線形関数を遂次的に学習し区分的に線形近似するニューラルネットである.このネットの有効性は関数近似,制御,降水量推定などへの応用において示されているが,その学習法は基本的にこう配法に基づく競合学習を含んでおり,局所解問題をもつ.この問題を回避するために,本論文ではまずネットを構成するユニット数が非常に多い場合を考え,近似すべき関数の平均2乗誤差を最小化するための最適性の条件,すなわち漸近最適条件を導く.この条件は各時刻の荷重配置が最適解に近いかどうかを判断するために用いることができると同時に,最適解により近い荷重配置を示唆することができる.そこでこの条件をこう配法による学習に組み入れる.すなわちこう配法により得られた荷重配置が最適解に近くないと判断されるときはあるユニットの荷重を最適解に近い荷重配置になるように再初期化する学習法を構成する.最後にこの学習法をいくつかのベンチマーク関数に適用する数値実験を通して本手法の有効性を確認するとともに,BPN (Back-Propagation Net), RBFN (Radial Basis Function Net)及びSVR (Support Vector Regression)の実験結果と比較し,本手法を用いるCAN2の関数近似性能の高さを示す.","subitem_description_language":"ja","subitem_description_type":"Abstract"}]},"item_21_description_60":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"Journal Article","subitem_description_type":"Other"}]},"item_21_publisher_7":{"attribute_name":"出版社","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会","subitem_publisher_language":"ja"}]},"item_21_select_59":{"attribute_name":"査読の有無","attribute_value_mlt":[{"subitem_select_item":"yes"}]},"item_21_source_id_10":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AA11325909","subitem_source_identifier_type":"NCID"}]},"item_21_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0915-1923","subitem_source_identifier_type":"PISSN"}]},"item_21_text_64":{"attribute_name":"業績ID","attribute_value_mlt":[{"subitem_text_value":"69F6ACB1C71DFA71492575590030081C"}]},"item_21_version_type_58":{"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":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[],"affiliationNames":[{"affiliationName":""}]}],"creatorNames":[{"creatorName":"Kurogi, Shuichi","creatorNameLang":"en"},{"creatorName":"黒木, 秀一","creatorNameLang":"ja"},{"creatorName":"クロギ, シュウイチ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2009-02-10"}],"displaytype":"detail","filename":"0915-1923_J86-D-2_2_P184.pdf","filesize":[{"value":"962.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"0915-1923_J86-D-2_2_P184.pdf","url":"https://kyutech.repo.nii.ac.jp/record/859/files/0915-1923_J86-D-2_2_P184.pdf"},"version_id":"6d301011-5c6d-476f-97b3-a40e13eae9fd"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"競合連想ネット","subitem_subject_scheme":"Other"},{"subitem_subject":"漸近最適性","subitem_subject_scheme":"Other"},{"subitem_subject":"競合学習","subitem_subject_scheme":"Other"},{"subitem_subject":"局所解問題","subitem_subject_scheme":"Other"},{"subitem_subject":"関数近似","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"競合連想ネットの漸近最適性と非線形関数の逐次学習への応用","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"競合連想ネットの漸近最適性と非線形関数の逐次学習への応用","subitem_title_language":"ja"},{"subitem_title":"Asymptotic Optimality of Competitive Associative Nets and Its Application to Incremental Learning of Nonlinear Functions","subitem_title_language":"en"}]},"item_type_id":"21","owner":"3","path":["24"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2009-02-10"},"publish_date":"2009-02-10","publish_status":"0","recid":"859","relation_version_is_last":true,"title":["競合連想ネットの漸近最適性と非線形関数の逐次学習への応用"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-10-25T06:04:27.037013+00:00"}