Name
Abstract | ||
|---|---|---|
Methods for efficiently estimating the Shannon entropy of data streams have important applications in learning, data mining, and network anomaly detections (e.g., the DDoS attacks). For nonnegative data streams, the method of Compressed Counting (CC) based on maximally-skewed stable random projections can provide accurate estimates of the Shannon entropy using small storage. However, CC is no longer applicable when entries of data streams can be below zero, which is a common scenario when comparing two streams. In this paper, we propose an algorithm for entropy estimation in general data streams which allow negative entries. In our method, the Shannon entropy is approximated by the finite difference of two correlated frequency moments estimated from correlated samples of symmetric stable random variables. Our experiments confirm that this method is able to substantially better approximate the Shannon entropy compared to the prior state-of-the-art. |
Year | Venue | Field |
|---|---|---|
2012 | NIPS | Entropy power inequality,Mathematical optimization,Entropy rate,Rényi entropy,Shannon's source coding theorem,Joint entropy,Principle of maximum entropy,Min entropy,Mathematics,Maximum entropy probability distribution |
DocType | Citations | PageRank |
Conference | 3 | 0.39 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Li | 1 | 1672 | 127.72 |
| Cun-Hui Zhang | 2 | 174 | 18.38 |