258 citations · 976 across the 76 of their papers we have counts for
8 papers · 1 filter
Improving Compressed Counting
Ping Li
Compressed Counting (CC) [22] was recently proposed for estimating the ath frequency moments of data streams, where 0 < a <= 2. CC can be used for estimating Shannon entropy, which…
On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting
Ping Li
Estimating the p-th frequency moment of data stream is a very heavily studied problem. The problem is actually trivial when p = 1, assuming the strict Turnstile model. The sample c…
b-Bit Minwise Hashing
Ping Li, Arnd Christian Konig
This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g.,…
Estimating Entropy of Data Streams Using Compressed Counting
Ping Li
The Shannon entropy is a widely used summary statistic, for example, network traffic measurement, anomaly detection, neural computations, spike trains, etc. This study focuses on e…
On the Sample Complexity of Compressed Counting
Ping Li
Compressed Counting (CC), based on maximally skewed stable random projections, was recently proposed for estimating the p-th frequency moments of data streams. The case p->1 is ext…
The Optimal Quantile Estimator for Compressed Counting
Ping Li
Compressed Counting (CC) was recently proposed for very efficiently computing the (approximate) th frequency moments of data streams, where . Several estimators were re…