A high-performance algorithm for identifying frequent items in data streams.
Daniel AndersonPryce BevanKevin J. LangEdo LibertyLee RhodesJustin ThalerPublished in: Internet Measurement Conference (2017)
Keyphrases
- data streams
- computationally efficient
- optimal solution
- improved algorithm
- detection algorithm
- sliding window
- objective function
- preprocessing
- probabilistic model
- experimental evaluation
- theoretical analysis
- cost function
- k means
- high efficiency
- data sets
- learning algorithm
- recognition algorithm
- times faster
- matching algorithm
- tree structure
- single pass
- expectation maximization
- dynamic programming
- np hard
- search space
- optimization algorithm
- input data
- high accuracy
- worst case
- computational cost
- noisy data
- computational complexity