{"created":"2025-01-19T01:20:11.200268+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220139","sets":["1164:2592:10824:11000"]},"path":["11000"],"owner":"44499","recid":"220139","title":["ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-08"},"_buckets":{"deposit":"07b3911a-f7b5-4d79-8eb0-2e00e03c6e74"},"_deposit":{"id":"220139","pid":{"type":"depid","value":"220139","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム","author_link":["575136","575137","575138","575139"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム"},{"subitem_title":"Randomized Counter-Based Algorithms for Frequency Estimation over Data Streams in ????(log log ????) space","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-09-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学理工学部"},{"subitem_text_value":"日本IBM"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematics, Faculty of Science and Technology, Keio University","subitem_text_language":"en"},{"subitem_text_value":"IBM Japan","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/220139/files/IPSJ-AL22189001.pdf","label":"IPSJ-AL22189001.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22189001.pdf","filesize":[{"value":"813.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"69053230-9733-4f6f-bd0d-2f852954d357","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"垣村, 尚徳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"新田, 陸"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naonori, Kakimura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Riku, Nitta","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本講演では，データストリーム中の各アイテムの頻度を見積もる問題に対して，省領域の乱択ストリーミングアルゴリズムを提案する．提案アルゴリズムは，確率的数え上げをもちいたカウンターにもとづくアルゴリズムである．???? をアイテムの総数としたとき，???? 個のカウンターをもつ提案アルゴリズムは，1 − ???? 以上の確率で，各アイテムの頻度を相対誤差 (1 + ????) ????/???? 以内で見積もる．このときの空間計算量は???? (???? log log ???? + ???? log (????−1????−1???? ) ) である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This note studies the problem of estimating frequencies of items over data streams. We propose a simple streaming algorithm for the problem in small space complexity. Our algorithm is a counter-based algorithm with the aid of probabilistic counting. We show that our algorithm with ???? counters computes, with probability at least 1 − ????, the estimation with relative error at most (1 + ????) ????/????, where ???? is the total number of items, taking ???? (???? log log ???? + ???? log (????−1????−1???? ) ) space.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022-AL-189"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220139,"updated":"2025-01-19T14:39:19.337405+00:00","links":{}}