{"id":73774,"updated":"2025-01-21T21:48:44.916028+00:00","links":{},"created":"2025-01-18T23:31:35.503338+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00073774","sets":["934:1022:6385:6386"]},"path":["6386"],"owner":"11","recid":"73774","title":["有益な検索結果提示のための部分文書再構成手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-03-25"},"_buckets":{"deposit":"623348a7-7993-4912-8574-31de3fbda89d"},"_deposit":{"id":"73774","pid":{"type":"depid","value":"73774","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 Proposal of a Reconstruction Method to Return Well-informative Search Results","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-03-25","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 Culture and Information Science, Doshisha University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Culture and Information Science, Doshisha University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science, Nara Institute of Science and Technology","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/73774/files/IPSJ-TOD0401002.pdf"},"date":[{"dateType":"Available","dateValue":"2013-03-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0401002.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"07fb8e83-eb69-42a2-80d7-393c21b118e2","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 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":"Atsushi, Keyaki","creatorNameLang":"en"},{"creatorName":"Kenji, Hatano","creatorNameLang":"en"},{"creatorName":"Jun, Miyazaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","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-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"XML 文書を対象とした情報検索では，文書単位よりも細かな粒度の部分文書を対象とした検索を行うことが可能である．従来の部分文書に対する検索技術では，各部分文書に対するクエリへの適合度の算出方法に焦点を当てているため，各適合度すなわちスコアリング結果から，検索結果である部分文書 1 つ 1 つをどのように構成するのかということに関しては十分に議論されてこなかった．しかしながら，各部分文書の持つスコアのみに依存した形での検索結果の提示方法では，1) 大きすぎる （不要な部分を含む） 粒度の部分文書が抽出される，2) 適合部分文書の一部しか抽出できない，といった問題が起こりうる．これらの問題を解決するため，我々は各部分文書のテキストサイズと部分文書間の包含関係を考慮した適合部分抽出手法を提案する．さらに，先祖や子孫の部分文書の統計量を考慮したスコアリング手法を提案し，情報要求に強く合致する部分文書を検索結果上位にランキングすることを目指す．評価実験の結果，提案手法は従来手法と比較して約 8% 検索精度が改善された．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a method for identifying appropriate granular fragments for user information needs and obtaining more accurate search results in XML fragment search. Existing approaches simply generate a ranked list in descending order of each XML fragment's relevance to a search query. These approaches have problems, i.e., they may extract irrelevant fragments and overlook more relevant fragments. To address these problems, we generate a refined ranked list through two steps. First, we extract and reconstruct relevant fragments considering the sizes of XML fragments and relationships among XML fragments in a simple ranked list. Second, we score these XML fragments with useful statistics of its descendant/ancestor XML fragments. Our experimental results show that our method improves search accuracy by 8% compared with simple BM25E which neither reconstruct XML fragments nor use some kinds of statistics.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"13","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-03-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}