{"links":{},"id":32067,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032067","sets":["1164:2592:2640:2646"]},"path":["2646"],"owner":"1","recid":"32067","title":["検索確率をもつ二分探索木の探索長の最適期待値を与える領域分割の生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-01-19"},"_buckets":{"deposit":"8a96840d-6550-45b6-b4d0-c3f8d4dbc7fd"},"_deposit":{"id":"32067","pid":{"type":"depid","value":"32067","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"検索確率をもつ二分探索木の探索長の最適期待値を与える領域分割の生成","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"検索確率をもつ二分探索木の探索長の最適期待値を与える領域分割の生成"},{"subitem_title":"Generation of subdivision for binary search tree with optimal path length of search probability","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-01-19","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":"Graduate School of Information Systems, The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Systems, The University of Electro - Communications","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/32067/files/IPSJ-AL00076010.pdf"},"date":[{"dateType":"Available","dateValue":"2003-01-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL00076010.pdf","filesize":[{"value":"502.0 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":"58d08662-559b-437b-bb23-4981d15d3889","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 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":"Kensuke, Onishi","creatorNameLang":"en"},{"creatorName":"Mamoru, Hoshi","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":"点集合とその検索確率が与えられた場合に，検索路長の最適期待値を与える二分探索木を構成する問題を考える．本研究では，n点の点が与えられた場合に，どのような形状の木が最適であるかを，n次元離散確率分布を表現するn次元領域の分割をアレンジメントを用いて生成することにより任意の確率分布に対する最適木を与える.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper it is dealt with to find the best possible tree for searching table of keys with given probability. Our approach is that all binary search trees and its corresponding region of the parametric space of discrete probability distribution are constructed. In other words, for given n (number of set of points), we generate a subdivision of the parametric space of n-dimensional discrete probability distribution by hyperplane arrangement. Each region corresponds to a binary search tree and in the region such tree has optimal path length.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"72","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"65","bibliographicIssueDates":{"bibliographicIssueDate":"2001-01-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7(2000-AL-076)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:14.895579+00:00","updated":"2025-01-22T16:20:56.176221+00:00"}