{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00077564","sets":["6164:6165:6522:6534"]},"path":["6534"],"owner":"11","recid":"77564","title":["コルモゴロフ複雑性の新規概算法に基づく仕様間の整合性判定"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-09-06"},"_buckets":{"deposit":"1f8cabf4-ddb8-488d-a64b-a7bd4ae45f4d"},"_deposit":{"id":"77564","pid":{"type":"depid","value":"77564","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"コルモゴロフ複雑性の新規概算法に基づく仕様間の整合性判定","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"コルモゴロフ複雑性の新規概算法に基づく仕様間の整合性判定"},{"subitem_title":"A Consistency Detecting Method of Software Specifications using a New Approximate Calculation of Kolmogorov Complexity","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"要求","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2011-09-06","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NECサービスプラットフォーム研究所"},{"subitem_text_value":"NECサービスプラットフォーム研究所"},{"subitem_text_value":"NECサービスプラットフォーム研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Service Platform Laboratories, NEC Corporation","subitem_text_language":"en"},{"subitem_text_value":"Service Platform Laboratories, NEC Corporation","subitem_text_language":"en"},{"subitem_text_value":"Service Platform Laboratories, NEC Corporation","subitem_text_language":"en"}]},"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/77564/files/IPSJ-SES2011021.pdf"},"date":[{"dateType":"Available","dateValue":"2013-09-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SES2011021.pdf","filesize":[{"value":"100.3 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":"12"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"71c5fba5-92cc-40ba-9c34-1373fb13c8d8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤原, 由希子"},{"creatorName":"五藤, 智久"},{"creatorName":"谷, 幹也"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yukiko, Fujiwara","creatorNameLang":"en"},{"creatorName":"Tomohisa, Gotoh","creatorNameLang":"en"},{"creatorName":"Mikiya, Tani","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"我々は，仕様間の整合性判定として，仕様間の類似度をコルモゴロフ複雑性の従来の概算法を用いて計算し，類似度のランク上位の仕様間を整合と判定する方法を提案してきた．本稿では，コルモゴロフ複雑性の新規な概算法を提案する．提案法は，2 つのプロジェクトにおけるランク上位の判定精度を用いて評価した．その結果，提案法の判定精度は従来の概算法以上だった．また，従来法である潜在的ディリクレ配分やベクトル空間法と比較したところ，提案法の判定精度が最も高かった．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We have proposed a method of consistency detection between software specifications, in which the similarities of specification pairs are calculated using the approximate calculation method of Kolmogorov complexity and the specifications pairs corresponding to top-rank similarities are predicted as consist.  In this paper, we propose a new approximate calculation method of Kolmogorov complexity.  We evaluated our method using top-rank detection accuracy in two projects.  We compared our method with the previous approximate calculation method and the results showed that our method performed equal or better than the previous method.  Also, we compared our method with latent Dirichlet allocation and vector space model, which was used in predicting the traceability links.  The results showed that our method performed better than the other methods.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"ソフトウェアエンジニアリングシンポジウム2011論文集"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-09-06","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":77564,"updated":"2025-01-21T20:52:23.420491+00:00","links":{},"created":"2025-01-18T23:33:07.229585+00:00"}