{"created":"2025-01-18T23:29:26.745734+00:00","updated":"2025-01-21T23:35:00.986469+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00070150","sets":["581:5994:6149"]},"path":["6149"],"owner":"11","recid":"70150","title":["評価者間類似度計算の改善による汚染コンテンツダウンロード抑制効果向上"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-08-15"},"_buckets":{"deposit":"0eb69f15-d38e-436d-9e03-c44831a43583"},"_deposit":{"id":"70150","pid":{"type":"depid","value":"70150","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":"Refinements of Raters' Similarity Computation for Prevention of Downloading Polluted Contents","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2010-08-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"奈良工業高等専門学校情報工学科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"京都産業大学コンピュータ理工学部"},{"subitem_text_value":"兵庫医療大学"},{"subitem_text_value":"情報通信研究機構"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Information Engineering, Nara National College of Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Computer Science and Engineering, Kyoto Sangyo University","subitem_text_language":"en"},{"subitem_text_value":"Hyogo University of Health Sciences","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Information and Communications Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/70150/files/IPSJ-JNL5108004.pdf"},"date":[{"dateType":"Available","dateValue":"2012-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5108004.pdf","filesize":[{"value":"1.3 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ebbcffd6-1afa-4d3a-b03b-e8caf577ad46","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山中, 広明"},{"creatorName":"岡村, 真吾"},{"creatorName":"藤原, 融"},{"creatorName":"吉田, 真紀"},{"creatorName":"石原, 靖哲"},{"creatorName":"秋山, 豊和"},{"creatorName":"加藤, 精一"},{"creatorName":"下條, 真司"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroaki, Yamanaka","creatorNameLang":"en"},{"creatorName":"Shingo, Okamura","creatorNameLang":"en"},{"creatorName":"Toru, Fujiwara","creatorNameLang":"en"},{"creatorName":"Maki, Yoshida","creatorNameLang":"en"},{"creatorName":"Yasunori, Ishihara","creatorNameLang":"en"},{"creatorName":"Toyokazu, Akiyama","creatorNameLang":"en"},{"creatorName":"Seiichi, X.Kato","creatorNameLang":"en"},{"creatorName":"Shinji, Shimojo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"P2Pコンテンツ共有において，汚染コンテンツのダウンロードを抑制するため，評判システムを適用することが考えられている．評判システムでは，コンテンツをダウンロードしたピアがその提供者に評価値をつけ，各ピアの評価値から信頼度値を計算し，それを基に提供ピアを選択する．不正評価者の割合が小さいときは，既存手法の中でも相加平均等の単純な信頼度値計算法の抑制効果が最も高い．一方，不正評価者の割合が大きいときは，共通の被評価者に対する評価値の類似度（評価者間類似度）による計算法の効果が最も高い．P2Pシステムでは，ピアの参加が自由で，不正評価者の割合の変動が大きいことがあるため，その予想は困難である．そこで，本論文では，不正評価者の割合にかかわらず高い抑制効果を得る計算法を提案する．提案手法では，まず，共通の被評価者が存在しないピア間についても評価者間類似度を求め，評価者間類似度による信頼度値を計算できる場合を拡大する．それでも計算できないピアの信頼度値は相加平均で計算する．シミュレーションの結果，不正評価者の割合15%以下では相加平均と同じ抑制効果が得られ，50%以下では評価者間類似度による計算法より高い効果が得られた．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In Peer-to-Peer (P2P) contents sharing, reputation system is applied to prevent downloading polluted (inauthentic) contents. In the system, peers rate each other in respect of providing contents, and their trust values are computed and used to select contents providers. When the ratio of dishonest raters to all the raters is low, a simple trust value computation such as arithmetic average is most effective. On the other hand, when the ratio is high, trust value computations based on raters' similarity perform better. The portion of dishonest raters is unpredictable due to the open and anonymous nature of P2P. In this paper, we propose a method for computing trust values with high performance regardless of the ratio. The proposed method tries to compute similarities between raters even when they have no common ratees. When it fails, the arithmetic average is used. By simulations, the proposed method provides the prevention effect as high as the arithmetic average when the ratio is less than 15% and higher than that of raters' similarity-based trust value computation when the ratio is less than 50%.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1442","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1428","bibliographicIssueDates":{"bibliographicIssueDate":"2010-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"51"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":70150,"links":{}}