{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227758","sets":["1164:1165:11326:11327"]},"path":["11327"],"owner":"44499","recid":"227758","title":["多様性を考慮したempty-answer問題解決の高速化手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-09-14"},"_buckets":{"deposit":"642904bb-926c-4327-8ca5-a4b23cad99d8"},"_deposit":{"id":"227758","pid":{"type":"depid","value":"227758","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"多様性を考慮したempty-answer問題解決の高速化手法","author_link":["607155","607157","607156"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多様性を考慮したempty-answer問題解決の高速化手法"},{"subitem_title":"A method for speeding up empty-answer problem solving taking into diversity","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-09-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka 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/227758/files/IPSJ-DBS23177026.pdf","label":"IPSJ-DBS23177026.pdf"},"date":[{"dateType":"Available","dateValue":"2025-09-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS23177026.pdf","filesize":[{"value":"1.1 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":"44"}],"accessrole":"open_date","version_id":"5e360d55-d7c6-4d70-a268-2ea728ee5f58","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"池田, 悠人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"肖, 川"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鬼塚, 真"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-871X","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"empty-answer 問題とは，ユーザがクエリを与えた際に，その条件の多さや厳しさのために条件を満たすレコードが得られないことである．この問題の解決に向け，既存手法においては，主にランキング関数を利用する方法と，レコードを得られるような緩和したクエリを探索する手法の 2 つが提案されている．しかしこれらの手法においては，ユーザが得られるレコード群の多様性を担保した手法が存在しない．そこで本研究では，ランキング関数に多様性を考慮した項を組み込み，多様性とクエリからの類似性の双方が高いレコード群を探索する高速化手法を提案する．本研究では，多様性とクエリからの類似性の双方が高い緩和クエリ群を探索することで，クエリから得られるレコードの類似性と多様性を確保するアルゴリズムを提案する．本研究における実験により，精度を維持しながら 50 倍以上の高速化の達成を確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The empty-answer problem is a problem in which records are not obtained when a user gives a query due to too many or too strict conditions. To solve this problem, two methods have been proposed: one is to use a ranking function, and the other is to search for a relaxed query that will yield records. However, in these methods, there is no method that guarantees the diversity of records obtained by users. Therefore, this study proposes a method to speed up the search for records that satisfy both diversity and similarity from the query by incorporating a term that takes diversity into account in the ranking function. In this study, we propose an algorithm that ensures the similarity and diversity of records obtained from queries by relaxing queries to search records that satisfy similarity at high speed and by using relaxed queries that satisfy diversity. Experiments in this study have achieved at least a 10-fold speedup while maintaining accuracy.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-09-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"26","bibliographicVolumeNumber":"2023-DBS-177"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:27:00.684382+00:00","updated":"2025-01-19T12:04:52.215423+00:00","id":227758}