{"created":"2023-07-25T09:05:23.313166+00:00","id":3414,"links":{},"metadata":{"_buckets":{"deposit":"0cd6ae20-d19f-4d45-9739-e5c883e54760"},"_deposit":{"created_by":3,"id":"3414","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3414"},"status":"published"},"_oai":{"id":"oai:toyama.repo.nii.ac.jp:00003414","sets":["496:556:557:558"]},"author_link":["12127","12158","12094","12093"],"item_2_alternative_title_19":{"attribute_name":"その他（別言語等）のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"High Speed Optimization Method on Cost-Based Abduction Using Improved Hill Climbing Algorithm"}]},"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"43","bibliographicPageStart":"39","bibliographicVolumeNumber":"86","bibliographic_titles":[{"bibliographic_title":"電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理"}]}]},"item_2_description_15":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_2_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"本論文では,コストに基づく仮説推論における最適解法の手法として,山登り法を改良した手法を提案する.また,回路の故障診断問題に適用し,従来の高速化を実現したA^*アルゴリズムによるコストに基づく仮説推論システムとの比較実験を行い大幅な速度向上を実現できることを示す.","subitem_description_type":"Abstract"}]},"item_2_description_40":{"attribute_name":"資源タイプ(DSpace)","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_type":"Other"}]},"item_2_description_6":{"attribute_name":"引用","attribute_value_mlt":[{"subitem_description":"電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理 J86-D-I(1), 39-43.(2003)","subitem_description_type":"Other"}]},"item_2_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"12127","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"9000001535236","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/9000001535236"},{"nameIdentifier":"90369968","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/nrid/1000090369968"}],"names":[{"name":"Koshino, Makoto"}]},{"nameIdentifiers":[{"nameIdentifier":"12158","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"9000006794753","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/9000006794753"},{"nameIdentifier":"90398991","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/nrid/1000090398991"}],"names":[{"name":"Misawa, Tadanobu"}]},{"nameIdentifiers":[{"nameIdentifier":"12094","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"1000060141371","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/1000060141371"},{"nameIdentifier":"60141371","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/nrid/1000060141371"}],"names":[{"name":"Kimura, Haruhiko"}]},{"nameIdentifiers":[{"nameIdentifier":"12093","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"9000018299839","nameIdentifierScheme":"CiNii ID","nameIdentifierURI":"http://ci.nii.ac.jp/nrid/9000018299839"}],"names":[{"name":"Hirose, Sadaki"}]}]},"item_2_publisher_33":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_2_relation_42":{"attribute_name":"関係URI","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"http://search.ieice.org/index.html"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://search.ieice.org/index.html","subitem_relation_type_select":"URI"}}]},"item_2_rights_13":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"copyright©2003 IEICE"},{"subitem_rights":"本文データは学協会の許諾に基づきCiNiiから複製したものである"}]},"item_2_source_id_10":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11341020","subitem_source_identifier_type":"NCID"}]},"item_2_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09151915","subitem_source_identifier_type":"ISSN"}]},"item_2_version_type_16":{"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":"越野, 亮"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"参沢, 匡将"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"木村, 春彦"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"広瀬, 貞樹"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-16"}],"displaytype":"detail","filename":"J86-D-Ⅰ(1).pdf","filesize":[{"value":"403.1 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"J86-D-Ⅰ(1)","url":"https://toyama.repo.nii.ac.jp/record/3414/files/J86-D-Ⅰ(1).pdf"},"version_id":"3e3426a3-3743-457f-bd18-0e8ae6864f74"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コストに基づく仮説推論","subitem_subject_scheme":"Other"},{"subitem_subject":"山登り法","subitem_subject_scheme":"Other"},{"subitem_subject":"A^*アルゴリズム","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":"改良山登り法によるコストに基づく仮説推論の高速最適解法"}]},"item_type_id":"2","owner":"3","path":["558"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-12-02"},"publish_date":"2011-12-02","publish_status":"0","recid":"3414","relation_version_is_last":true,"title":["改良山登り法によるコストに基づく仮説推論の高速最適解法"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-25T14:01:56.530138+00:00"}