{"updated":"2025-01-22T23:32:59.365095+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017075","sets":["934:989:992:993"]},"path":["993"],"owner":"1","recid":"17075","title":["Extremal Optimization による調停グラフの交差数減少"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-03-15"},"_buckets":{"deposit":"88db4b8a-25c1-492b-a7c1-8c2ea36a60a7"},"_deposit":{"id":"17075","pid":{"type":"depid","value":"17075","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Extremal Optimization による調停グラフの交差数減少","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Extremal Optimization による調停グラフの交差数減少"},{"subitem_title":"Reducing Crossovers in Reconciliation Graphs with Extremal Optimization","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"オリジナル論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-03-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島市立大学大学院情報科学研究科"},{"subitem_text_value":"広島市立大学大学院情報科学研究科"},{"subitem_text_value":"広島市立大学大学院情報科学研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","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/17075/files/IPSJ-TOM4904012.pdf"},"date":[{"dateType":"Available","dateValue":"2010-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM4904012.pdf","filesize":[{"value":"757.8 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":"fec9f139-3a28-4de0-a694-2755dc90fc3d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田村, 慶一"},{"creatorName":"森, 康真"},{"creatorName":"北上, 始"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keiichi, Tamura","creatorNameLang":"en"},{"creatorName":"Yasuma, Mori","creatorNameLang":"en"},{"creatorName":"Hajime, Kitakami","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"系統樹を比較する手法の1 つとして調停が提案されている．調停では，系統樹を順序木と見なし，2 つの順序木を向き合わせた調停グラフを作成する．調停を潤滑に進めるためには，順序木の葉節点間に交差がないか，もしくはできるだけ交差が少ない調停グラフを作成する必要がある．本論文では，Extremal Optimization（EO）による調停グラフの交差減少を提案する．EO を適用するにあたり，EO に対して，（1）ルーレット選択により状態遷移の候補となる構成要素を選択する，（2）複数の近傍解中の最良解を次世代の解とする，という2 つの改良を加えた．評価実験の結果，提案手法による調停グラフの交差数減少の方がEO と比較して優れていることを確認した．また，タブーサーチ，SA や遺伝的プログラミングを使用した手法よりも良い結果を求めることができることを確認できた．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The reconciliation is a one of techniques for comparing phylogenetic trees. In the reconciliation,a phylogenetic tree is considered to be an ordered tree, order trees are made to be opposite, and the reconciliation graph is made. There is no intersection between leaf nodes to advance reconciliation to lubrication or it is necessary to make reconciliation graph where intersection is a little. This paper proposes the reducing crossovers in reconciliation graphs with Extremal Optimization (EO). There are two characteristics in the proposed method. The construct which serves as a candidate of a change state by roulette selecting is chosen. The best solution in two or more neighborhoods is chosen as the next solution. The experimental results show that the proposed method is excellent as compared with EO, tabu search, SA and GP.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"116","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"105","bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG4(TOM20)","bibliographicVolumeNumber":"49"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:10.259466+00:00","id":17075,"links":{}}