{"created":"2025-01-18T23:27:38.096677+00:00","updated":"2025-01-22T00:46:56.253589+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00067032","sets":["1164:5352:5656:5934"]},"path":["5934"],"owner":"10","recid":"67032","title":["ギブスサンプリングとアラインメント処理に基づく類似部分配列の抽出方式"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-12-10"},"_buckets":{"deposit":"c708f579-83cf-4ce1-8997-831f4edc6c8e"},"_deposit":{"id":"67032","pid":{"type":"depid","value":"67032","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"ギブスサンプリングとアラインメント処理に基づく類似部分配列の抽出方式","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ギブスサンプリングとアラインメント処理に基づく類似部分配列の抽出方式"},{"subitem_title":"A Method for Extracting Similar Subsequences based on Gibbs Sampling and Multiple Alignment","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2009-12-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島市立大学情報科学研究科"},{"subitem_text_value":"広島市立大学情報科学研究科"},{"subitem_text_value":"広島市立大学情報科学研究科"},{"subitem_text_value":"広島市立大学情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, 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/67032/files/IPSJ-BIO09019046.pdf"},"date":[{"dateType":"Available","dateValue":"2011-12-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO09019046.pdf","filesize":[{"value":"539.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":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9831fbf7-fa4b-4392-8b1a-47f6cb4a6840","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"河野, 修久"},{"creatorName":"田村, 慶一"},{"creatorName":"森, 康真"},{"creatorName":"北上, 始"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nobuhisa, Kono","creatorNameLang":"en"},{"creatorName":"Keiichi, Tamura","creatorNameLang":"en"},{"creatorName":"Yasuma, Mori","creatorNameLang":"en"},{"creatorName":"Hajime, Kitakami","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12055912","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":"配列データマイニング処理では，配列データベースから非常に多くの頻出配列パターンが抽出される．この頻出配列パターンを大幅に削減するために，本論文では，遺伝的アルゴリズムの世代交代モデルの 1 つである Minimal Generation Gap (MGG) と分散遺伝的アルゴリズム (島モデル) の考え方をギブスサンプリングに応用し，抽出する部分文字列長を自動決定することが可能である類似部分配列抽出法 Gibbs-DMGG を提案する．また，Gibbs-DMGG により抽出された類似部分配列集合に対しマルチプルアラインメントを実施し，その実施結果として得られる集合から類似部分配列を抽出する．評価実験により，Gibbs-DMGG が高い再現率を持つと同時にマルチプルアラインメントの実施が Gibbs-DMGG の適合率を 4～5％ 程度向上させることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the field of sequence data mining, a large quantity of frequent sequential patterns are extracted from a sequence database. In order to significantly reduce these frequent sequential patterns, we propose in this paper a new similar subsequence extraction method having the capacity to automatically determine the length of a similar subsequence called Gibbs-DMGG. This method applies Minimal Generation Gap (MGG), a generation alternation model of the genetic algorithm, and a distributed population scheme called the Island model. Moreover, we execute a multiple alignment for similar subsequence set extracted by Gibbs-DMGG. After that, we extract similar subsequences using Gibbs-DMGG from the set provided as the result of the multiple alignment. We show that the use of the multiple alignment not only improves Precision of Gibbs-DMGG around 5% but also keeps Gibbs-DMGG with a high Recall in an evaluation experiment.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告バイオ情報学（BIO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2009-12-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"46","bibliographicVolumeNumber":"2009-BIO-19"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":67032,"links":{}}