Lower bound for estimating frequency for update data streams.
Sumit GangulyPublished in: Sublinear Algorithms (2008)
Keyphrases
- lower bound
- data streams
- upper bound
- heavy hitters
- sliding window
- branch and bound algorithm
- concept drift
- sensor networks
- worst case
- objective function
- branch and bound
- optimal solution
- streaming data
- lower and upper bounds
- data stream mining
- limited memory
- non stationary
- np hard
- mining data streams
- change detection
- low frequency
- data distribution
- lower bounding
- high frequency
- frequent itemsets
- online learning