An Improved Misra-Gries algorithm for Finding Top-k Frequent Items and Its Parallelized Implementation
碩士 === 國立中山大學 === 資訊工程學系研究所 === 106 === The problem of finding top-k frequent items over data streams is very popular and heavily studied in data streams analysis, and it is widely used in many applications, such as network traffic monitoring and identifying high-clicker commodity. However, exactly...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/zan9p7 |