Estimating Entropy and Entropy Norm on Data Streams

DOI10.1080/15427951.2006.10129117MaRDI QIDQ3431006zbMATH OpenOpenAlexFDO

Authors

Publication date 5 April 2007

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1175266368

zbMATH Keywords

data streams

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Nonnumerical algorithms (68W05) Measures of information, entropy (94A17)

Recommendations

• Estimating Entropy and Entropy Norm on Data Streams
• Estimating Entropy over Data Streams
• A near-optimal algorithm for estimating the entropy of a stream
• A near-optimal algorithm for computing the entropy of a stream
• Sublinear estimation of entropy and information distances

Cited in

(15)

• Hierarchical sampling from sketches: Estimating functions over data streams
• Streaming generalized cross entropy
• Arthur-Merlin streaming complexity
• Improved algorithms for distributed entropy monitoring
• Symmetric norm estimation and regression on sliding windows
• Sublinear estimation of entropy and information distances
• A near-optimal algorithm for estimating the entropy of a stream
• A near-optimal algorithm for computing the entropy of a stream
• scientific article; zbMATH DE number 5899438 (Why is no real title available?)
• Compressed counting
• Continuous monitoring of _p norms in data streams
• Estimating Entropy over Data Streams
• Estimating Entropy and Entropy Norm on Data Streams
• Algorithms - ESA 2003
• Range entropy queries and partitioning

This page was built for publication: Estimating Entropy and Entropy Norm on Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431006)