{"links":{},"id":2002868,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02002868","sets":["1164:3925:11908:1749690073967"]},"path":["1749690073967"],"owner":"80578","recid":"2002868","title":["情報量重み付きJaccard係数の提案と評価"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-06-30"},"_buckets":{"deposit":"abca07e0-fb52-40a4-9e09-c3b497fdebf1"},"_deposit":{"id":"2002868","pid":{"type":"depid","value":"2002868","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"情報量重み付きJaccard係数の提案と評価","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"情報量重み付きJaccard係数の提案と評価","subitem_title_language":"ja"},{"subitem_title":"Proposal and Analysis of Entropy-Weighted Jaccard Index","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"CSEC","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2025-06-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"立命館大学大学院情報理工学研究科"},{"subitem_text_value":"立命館大学情報理工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Engineering, Ritsumeikan University","subitem_text_language":"en"},{"subitem_text_value":"College of Information Science and Engineering, Ritsumeikan 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/2002868/files/IPSJ-CSEC25110034.pdf","label":"IPSJ-CSEC25110034.pdf"},"date":[{"dateType":"Available","dateValue":"2027-06-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC25110034.pdf","filesize":[{"value":"1.2 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":"30"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"789fba04-7a4f-4149-9cb2-164db607eafe","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木村,悠生"}]},{"creatorNames":[{"creatorName":"上原,哲太郎"}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuuki Kimura","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Tetsutaro Uehara","creatorNameLang":"en"}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","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-8655","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"集合間の類似度指標として，Jaccard係数が広く用いられている．Jaccard係数は単純で計算効率が高いが，要素の出現頻度や重要度を区別できないという課題がある．本研究では，要素の出現確率に基づく情報量を重みとして導入し“情報量重み付きJaccard係数”を提案する．複数のデータセットに基づく実験により，提案手法は頻度偏りの大きい集合において従来指標を上回る性能を示すことが明らかになった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The Jaccard Index is widely used as a measure of similarity between sets. Although the Jaccard Index is simple and computationally efficient, it has the problem of not being able to distinguish between the frequency of occurrence and importance of elements. In this study, we propose an “Entropy Weighted Jaccard Index” by introducing entropy based on the probability of occurrence of elements as weights. Experimental results on several datasets show that the proposed method outperforms conventional indices for sets with highly skewed frequency distributions.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2025-06-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34","bibliographicVolumeNumber":"2025-CSEC-110"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"created":"2025-06-23T08:45:45.266664+00:00","updated":"2025-06-23T08:45:48.940882+00:00"}