[Solved]1 Count Median Sketch Consider Count Min Sketch Algorithm Class Determining Heavy Hitters Q37289254

1 Count-Median-Sketch Consider the Count-Min-Sketch algorithm from class for determining heavy hitters in a stream. Suppose that we change the algorithm to consider median,..Mli, hi(x)] instead of the min function (a) Give an argument that the estimator for heavy hitters is still correct. b) If we allow the stream to both insert and delete elements, show that the median based algorithm works to find heavy hitters. Each item r in the stream now comes with a an element Д E {+1,-1} indicating whether it is an addition operation or deletion. Note that the number of deletions could be more than the number of additions (c) Would Count-Min-Sketch work for the setup above? Show transcribed image text 1 Count-Median-Sketch Consider the Count-Min-Sketch algorithm from class for determining heavy hitters in a stream. Suppose that we change the algorithm to consider median,..Mli, hi(x)] instead of the min function (a) Give an argument that the estimator for heavy hitters is still correct. b) If we allow the stream to both insert and delete elements, show that the median based algorithm works to find heavy hitters. Each item r in the stream now comes with a an element Д E {+1,-1} indicating whether it is an addition operation or deletion. Note that the number of deletions could be more than the number of additions (c) Would Count-Min-Sketch work for the setup above?

Expert Answer

---

Answer to 1 Count-Median-Sketch Consider the Count-Min-Sketch algorithm from class for determining heavy hitters in a stream. Supp… . . .