{"created":"2025-01-18T23:37:21.965934+00:00","updated":"2025-01-21T17:59:07.738773+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00085819","sets":["934:1022:6752:6883"]},"path":["6883"],"owner":"11","recid":"85819","title":["リアルタイムバースト解析手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-09-28"},"_buckets":{"deposit":"5dad5768-b8bd-4784-aaae-9ca89383aef3"},"_deposit":{"id":"85819","pid":{"type":"depid","value":"85819","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 for a Real-time Burst Analysis Method","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[研究論文] バースト，データストリーム，リアルタイム，データマイニング，アルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2012-09-28","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 Information Science and Engineering, Ritsumeikan University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information Technology and Social Sciences, Osaka University of Economics","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/85819/files/IPSJ-TOD0503009.pdf"},"date":[{"dateType":"Available","dateValue":"2014-09-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0503009.pdf","filesize":[{"value":"1.7 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":"05695f53-c42b-429b-8f4e-a0cd765fbe74","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 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":"Ryohei, Ebina","creatorNameLang":"en"},{"creatorName":"Kenji, Nakamura","creatorNameLang":"en"},{"creatorName":"Shigeru, Oyanagi","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":"データストリームにおけるイベントの異常な集中発生はバーストと呼ばれ，複数のウィンドウサイズにわたったバーストを解析する様々な手法が提案されている．本論文では，データストリームのバーストの度合いやランキングをリアルタイムに解析する手法を提案する．本手法では，イベントが発生していない期間の無駄なデータの更新を防ぎ，イベントが集中発生している期間のデータを圧縮して保持することにより，バースト検出の計算量を削減している．さらに，バーストの検出と同時にバーストの度合いやランキングを算出することにより，これらに基づいた効率的な解析が可能となる．実験により，解析結果の有効性を示す．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A burst is an unusually large number of events occurring within a certain period of time. Various burst analysis methods over multiple window size have been proposed. This article proposes a method to analyze a burst on real time. The proposed method reduces computation by avoiding redundant data updates of no event occurrence, and by suppressing data within a certain period in the case of emergent increase of events. In addition, a level and a rank of a burst can be analyzed simultaneously. The effectiveness of the proposed method is evaluated by experiments with real data.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"96","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"86","bibliographicIssueDates":{"bibliographicIssueDate":"2012-09-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"5"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":85819,"links":{}}