Identifying correlated heavy-hitters
The heavy hitter problem asks to find the top k most frequent elements in a data stream. This problem has been used in many applications across network data analysis, event mining, etc. Many classical algorithms can only handle one-dimensional data such as Count-Sketch and Count-Min. But in this stu...
Saved in:
主要作者: | Zhou, Ziqi |
---|---|
其他作者: | Li Yi |
格式: | Final Year Project |
語言: | English |
出版: |
Nanyang Technological University
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/156923 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Deterministic heavy hitters with sublinear query time
由: Li, Yi, et al.
出版: (2018) -
On low-risk heavy hitters and sparse recovery schemes
由: Li, Yi, et al.
出版: (2018) -
Identifying actionable serial correlations in financial markets
由: Cheong, Siew Ann, et al.
出版: (2021) -
Ruin probability of insurer in a discrete time setting with heavy-tailed insurance and financial risks
由: Seah, Xin Hui
出版: (2019) -
New Method to Prepare Single-Headed Heavy Meromyosin with High Purity and a High Yield
由: Saeki, K., et al.
出版: (1989)