{"created":"2025-01-18T23:01:02.620267+00:00","updated":"2025-01-22T16:28:34.734296+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031794","sets":["1164:2592:2614:2618"]},"path":["2618"],"owner":"1","recid":"31794","title":["No Free Lunch Theoremの別証明と解釈"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-03-17"},"_buckets":{"deposit":"712f1704-426c-4cd0-8a9e-d70a8f4c3a16"},"_deposit":{"id":"31794","pid":{"type":"depid","value":"31794","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"No Free Lunch Theoremの別証明と解釈","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"No Free Lunch Theoremの別証明と解釈"},{"subitem_title":"Simple Proof and Interpretation of No Free Lunch Theorem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2005-03-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院新領域創成科学研究科基盤情報学専攻"},{"subitem_text_value":"東京大学大学院新領域創成科学研究科基盤情報学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Dept. of Frontier Infomatics Graduate School of Frontier Sciences The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Frontier Infomatics Graduate School of Frontier Sciences The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/31794/files/IPSJ-AL04100001.pdf"},"date":[{"dateType":"Available","dateValue":"2007-03-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL04100001.pdf","filesize":[{"value":"234.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1dc85f27-abc3-48d2-88c1-274bf221b004","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"柳井, 孝介"},{"creatorName":"伊庭, 斉志"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohsuke, Yanai","creatorNameLang":"en"},{"creatorName":"Hitoshi, Iba","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿ではNo Free Lunch Treorem （NFL）の別証明を与える．NFL は「どんな問題に対しても平均的に効率良く解けるような探索アルゴリズムは存在しない」ということを主張する定理であり，探索アルゴリズムあるいは最適化法の研究に大きな影響を与えた．本稿では，より簡潔でかつ直観的な証明を与える．我々は評価関数の空間を部分集合に分割し，それぞれの部分集合ごとにパフォーマンスが得られる確率を合計する．関数空間の分割により，定理のより深い理解が可能となり，またアルゴリズムと問題の関係が明確となる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, a simple proof of No Free Lunch Theorem (NFL) is presented. NFL asserts that no search algorithm exists which can solve every problem efficiently. This theorem has serious implications for the study of search algorithms and optimization. The proof given in this paper is simpler and more intuitive than the original one. In the proof, we divide the fitness function space into a set of subsets, and calculate the sum of probabilities in each subset. The division of the function space helps us to understand the theorem more clearly and highlights the relationship between algorithms and problems.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2005-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"26(2004-AL-100)","bibliographicVolumeNumber":"2005"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":31794,"links":{}}