{"updated":"2025-01-19T11:28:32.475954+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00229648","sets":["6504:11436:11438"]},"path":["11438"],"owner":"44499","recid":"229648","title":["確率微分方程式の統計量計算へのフロンティア法の利用と工夫"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-16"},"_buckets":{"deposit":"7c22444f-60a7-4296-a008-b5bf3cf279a7"},"_deposit":{"id":"229648","pid":{"type":"depid","value":"229648","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"確率微分方程式の統計量計算へのフロンティア法の利用と工夫","author_link":["617726","617727"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"確率微分方程式の統計量計算へのフロンティア法の利用と工夫"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2023-02-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"埼玉大"},{"subitem_text_value":"埼玉大"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/229648/files/IPSJ-Z85-1L-01.pdf","label":"IPSJ-Z85-1L-01.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-17"}],"format":"application/pdf","filename":"IPSJ-Z85-1L-01.pdf","filesize":[{"value":"510.4 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"8427ce51-2f2b-4b5a-970a-cd7ced098f19","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"濱, 晴矢"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大久保, 潤"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"確率微分方程式の統計量を、双対過程を用いることで組合せ論的な計算に帰着できることが最近の研究で明らかとなっている。しかし、複雑な系や長時間発展を考えた場合、その計算量は指数関数的に増加する。これまでは主に動的計画法が利用されてきたが、次元数が増えると計算に大量のメモリを必要とする。そこで本研究では、この組合せ論的な問題に対して、列挙アルゴリズムであるフロンティア法を適用して木構造を構築する手法について述べる。その際、メモリ削減のために分割数を利用した構築手法を提案する。構築した木構造から目的の統計量を求める数値実験を実施し、計算量とメモリの観点から提案手法を評価する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"238","bibliographic_titles":[{"bibliographic_title":"第85回全国大会講演論文集"}],"bibliographicPageStart":"237","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":229648,"created":"2025-01-19T01:28:55.775019+00:00"}