DMCA
A Simple Algorithm For Finding Frequent Elements In Streams And Bags (2003)
Cached
Download Links
by
Richard M. Karp
,
Scott Shenker
,
Christos H. Papadimitriou
| Citations: | 166 - 0 self |
BibTeX
@MISC{Karp03asimple,
author = {Richard M. Karp and Scott Shenker and Christos H. Papadimitriou},
title = {A Simple Algorithm For Finding Frequent Elements In Streams And Bags},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a simple, exact algorithm for identifying in a multiset the items with frequency more than a threshold θ. The algorithm requires two passes, linear time, and space 1/θ. The first pass is an on-line algorithm, generalizing a well-known algorithm for finding a majority element, for identifying a set of at most 1/θ items that includes, possibly among others, all items with frequency greater than θ.
