{"id":232807,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232807","sets":["1164:2735:11468:11517"]},"path":["11517"],"owner":"44499","recid":"232807","title":["鳩の巣原理に基づく類似ビットベクトルの探索法に関する一考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-02-29"},"_buckets":{"deposit":"fccac9cf-9c80-433a-8d6b-b654e4e05bc5"},"_deposit":{"id":"232807","pid":{"type":"depid","value":"232807","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"鳩の巣原理に基づく類似ビットベクトルの探索法に関する一考察","author_link":["631062","631063","631064","631065"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"鳩の巣原理に基づく類似ビットベクトルの探索法に関する一考察"}]},"item_type_id":"4","publish_date":"2024-02-29","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学"},{"subitem_text_value":"早稲田大学"},{"subitem_text_value":"日本電信電話株式会社"},{"subitem_text_value":"早稲田大学"}]},"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/232807/files/IPSJ-MPS24147024.pdf","label":"IPSJ-MPS24147024.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS24147024.pdf","filesize":[{"value":"893.9 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"18abb6ea-5a1c-4281-8994-2e900eed60f3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岡田, 拓斗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 健斗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鐘本, 楊"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"清水, 佳奈"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"与えられたビットベクトルの集合から，クエリ（任意のビットベクトル）とのハミング距離が閾値以下となる要素を効率よく列挙することは，様々な実データの分析に必要である．クエリ時間を短縮する方法として，ビットベクトルの集合に対して索引を構築する方法が複数提案されている．これらの索引法は鳩の巣原理に基づいており，パラメータの調整により同一の手順となりうるが，異なる特徴を持つ．本研究では，主要な二つの方法を実装し，大規模なソフトウェア群の類似解析に応用した場合の性能評価を行い，それぞれの方法の利点と改善点について議論する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-02-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"24","bibliographicVolumeNumber":"2024-MPS-147"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T10:18:55.382799+00:00","created":"2025-01-19T01:33:53.245968+00:00","links":{}}