Comments on “an integrated efficient solution for computing frequent and top-k elements in data streams”
暂无分享,去创建一个
We investigate a well-known algorithm, Space-Saving [Metwally et al. 2006], which has been proven efficient and effective at mining frequent elements in data streams. We discovered an error in one of the theorems in Metwally et al. [2006]. Experiments are conducted to illustrate the error.
[1] Divyakant Agrawal,et al. An integrated efficient solution for computing frequent and top-k elements in data streams , 2006, TODS.
[2] Gerhard Weikum,et al. ACM Transactions on Database Systems , 2005 .