{"created":"2025-01-19T01:37:21.778375+00:00","updated":"2025-01-19T09:32:44.884676+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00235722","sets":["6504:11678:11697"]},"path":["11697"],"owner":"44499","recid":"235722","title":["Median Iterationアルゴリズムのハイパーグラフへの拡張"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"92fe186b-9b6b-4a0d-840d-5bdd5c091df3"},"_deposit":{"id":"235722","pid":{"type":"depid","value":"235722","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Median Iterationアルゴリズムのハイパーグラフへの拡張","author_link":["644166","644167"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Median Iterationアルゴリズムのハイパーグラフへの拡張"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2024-03-01","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/235722/files/IPSJ-Z86-6K-06.pdf","label":"IPSJ-Z86-6K-06.pdf"},"date":[{"dateType":"Available","dateValue":"2024-07-03"}],"format":"application/pdf","filename":"IPSJ-Z86-6K-06.pdf","filesize":[{"value":"350.5 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"95dcd7d7-ccbe-4efc-a1d8-5c0d866e3fea","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":"TRIE木データ構造からダブル配列を構築する際に、各ノードの子ノードのID幅が小さいとコンパクトな配置になる。そこで、ID幅が小さくなるようにIDを入れ替える操作を行うが、この操作は、ハイパーグラフの線形配置問題として捉えることができる。我々はこれを解くために、巨大なデータ構造でも可能な、一般グラフの線形配置問題のヒューリスティックアルゴリズムであるMedian Iteration(MI)を、ハイパーグラフに適用できるように拡張した。また、MIは緩和問題に変換して解くため必ず良くなるとは限らない。我々は、MIで求まる各IDの移動を1対1での入れ替えにすることで必ず改善する手法を提案する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"226","bibliographic_titles":[{"bibliographic_title":"第86回全国大会講演論文集"}],"bibliographicPageStart":"225","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":235722,"links":{}}